Optimal message log reclamation for independent checkpointingIndependent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.
Document ID
19930046513
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Wang, Yi-Min (NASA Langley Research Center Hampton, VA, United States)
Fuchs, W. K. (Illinois Univ. Urbana, United States)
Date Acquired
August 16, 2013
Publication Date
August 1, 1993
Subject Category
Computer Systems
Meeting Information
Meeting: 1993 International Conference on Parallel Processing