Document Type

Technical Report

Department

Computer Science and Engineering

Publication Date

1993-01-01

Filename

WUCS-93-20.PDF

Technical Report Number

WUCS-93-20

Abstract

This paper shows how Koo and Toueg's distributed checkpointing algorithm can be modified so as to substantially reduce the average message volume. It attempts to avoid O(n{squared}) messages by using dependency knowledge to reduce the number of checkpoint request messages. Lemmas on consistency and termination are also included.

Comments

Permanent URL: http://dx.doi.org/10.7936/K7SJ1HSS

Share

COinS