Accession Number:

ADA280819

Title:

Optimal Message Log Reclamation for Uncoordinated Checkpointing

Descriptive Note:

Corporate Author:

ILLINOIS UNIV AT URBANA CENTER FOR RELIABLE AND HIGH-PERFORMANCE COMPUTING

Personal Author(s):

• Wang, Yi-Min
• Fuchs, W. K.

Report Date:

1994-01-01

Pagination or Media Count:

21.0

Abstract:

Uncoordinated 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.

Descriptors:

• *MESSAGE PROCESSING
• *GARBAGE
• ALGORITHMS
• COMPUTERIZED SIMULATION
• GLOBAL
• RECOVERY
• APPROACH
• TRANSFORMATIONS
• DECOMPOSITION
• OPTIMIZATION
• PROBLEM SOLVING
• RECORDS

Subject Categories:

• Computer Programming and Software

Distribution Statement:

APPROVED FOR PUBLIC RELEASE