Distributed Snapshots: Determining Global States of Distributed Systems

Distributed Snapshots: Determining Global States of Distributed Systems (1985)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by K. Mani Chandy

Venue:	ACM Transactions on Computer Systems
Citations:	929 - 5 self

Versions

Version History

Metadata Version 1

Datum	Value	Source
TITLE	Distributed Snapshots: Determining Global States of Distributed Systems	SVM HeaderParse 0.2
AUTHOR NAME	K. Mani Chandy	SVM HeaderParse 0.2
AUTHOR AFFIL	University of Texas at Austin; and; LESLIE LAMPORT; Stanford Research Institute	SVM HeaderParse 0.2
ABSTRACT	This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to solve an important class of problems: stable property detection. A stable property is one that persists: once a stable property becomes true it remains true thereafter. Examples of stable properties are “computation has terminated, ” “ the system is deadlocked ” and “all tokens in a token ring have disappeared. ” The stable property detection problem is that of devising algorithms to detect a given stable property. Global state detection can also be used for checkpointing. Categories and Subject Descriptors: C.2.4 [Computer-Communication Networks]: Distributed Systems-distributed applications; distributed databases; network operating systems; D.4.1 [Operating Systems]: Process Management-concurrency; deadlocks, multiprocessing/multiprogramming; mutual exclusion; scheduling; synchronization; D.4.5 [Operating Systems]: Reliability-backup procedures; checkpoint/restart; fault-tolerance; verification	SVM HeaderParse 0.2
YEAR	1985	INFERENCE
VENUE	ACM Transactions on Computer Systems	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	63--75	INFERENCE
VOLUME	3	INFERENCE
CITATIONS	11 found	ParsCit 1.0