Optimal Message Log Reclamation for Uncoordinated Checkpointing

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1994
Accession Number
ADA280819

Entities

People

  • W. Kent Fuchs
  • Yi-min Wang

Organizations

  • University of Illinois Urbana–Champaign

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Computer Science
  • Computers
  • Decomposition
  • Distributed Computing
  • Electronic Mail
  • Fault Tolerance
  • Fault Tolerant Computing
  • High Performance Computing
  • Information Processing
  • Operating Systems
  • Parallel Computing
  • Parallel Processing
  • Reclamation
  • Recovery
  • Simulations
  • Software Development

Fields of Study

  • Engineering

Readers

  • Logistics and Supply Chain Management.
  • Parallel and Distributed Computing.

Technology Areas

  • Space