Optimal message log reclamation for uncoordinated checkpointingUncoordinated checkpointing for message-passing systems allows maximum process autonomy and general nondeterministic execution, but suffers from potential domino effect and the large space overhead for maintaining checkpoints and message logs. Traditionally, it has been assumed that only obsolete checkpoints and message logs before the global recovery line can be garbage-collected. Recently, an approach to identifying all garbage checkpoints based on recovery line transformation and decomposition has been developed. We show in this paper that the same approach can be applied to the problem of identifying all garbage message logs for systems requiring message logging to record in-transit messages. Communication trace-driven simulation for several parallel programs is used to evaluate the proposed algorithm.
Document ID
19940034722
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
January 1, 1994
Subject Category
Computer Systems
Meeting Information
Meeting: International Federation for Information Processing, Working Conference on Dependable Computing for Critical Applications