Causal Distributed Breakpoints
Abstract
A causal distributed breakpoint is initiated by a sequential breakpoint in one process of a distributed computation, and restores each process in the computation to its earliest state that reflects all events that happened before the breakpoint. A casual distributed breakpoint is the natural extension for distributed programs of the conventional notion of a breakpoint in a sequential program. An algorithm is presented for finding the causal distributed breakpoint given a sequential breakpoint in one of the processes. Approximately consistent checkpoint sets are used for efficiently restoring each process to its state in a causal distributed breakpoint. Causal distributed breakpoints assume deterministic processes that communicate solely by messages. The dependencies that arise from communication between processes are logged. Dependency logging and approximately consistent checkpoints sets have been implemented on a network of SUN workstations running the V-System. Overhead on the message passing primitives varies between 1 and 14 percent for dependency logging. Execution time overhead for a 200 x 200 Gaussian elimination is less that 4 percent, and generates a dependency log of 288 kilobytes.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1990
- Accession Number
- ADA222103
Entities
People
- Jerry Fowler
- Willy Zwaenepoel
Organizations
- Rice University