• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

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

Cached

  • Download as a PDF

Download Links

  • [www.cs.umass.edu]
  • [research.microsoft.com]
  • [www.md.chalmers.se]
  • [courses.cs.vt.edu]
  • [www.cse.unsw.edu.au]
  • [www.csee.usf.edu]
  • [www.cse.usf.edu]
  • [www.cse.nd.edu]
  • [www.cs.swarthmore.edu]
  • [www.cs.mcgill.ca]
  • [www.utdallas.edu]
  • [wwwspies.informatik.tu-muenchen.de]
  • [www.cs.princeton.edu]
  • [lass.cs.umass.edu]
  • [lass.cs.umass.edu]
  • [www.cs.wisc.edu]
  • [www.nd.edu]
  • [www.lecs.cs.ucla.edu]
  • [www.cs.cornell.edu]
  • [www.cs.cornell.edu]
  • [www.cs.wisc.edu]
  • [www.cs.wisc.edu]
  • [lass.cs.umass.edu]
  • [www.cs.wisc.edu]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by K. Mani Chandy
Venue:ACM Transactions on Computer Systems
Citations:929 - 5 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Chandy85distributedsnapshots:,
    author = {K. Mani Chandy},
    title = {Distributed Snapshots: Determining Global States of Distributed Systems},
    journal = {ACM Transactions on Computer Systems},
    year = {1985},
    volume = {3},
    pages = {63--75}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

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

Citations

2115 Clocks and the Ordering of Events in a Distributed System - Lamport - 1978
240 Termination detection for diffusing computations - Dijkstra, Scholten - 1980
84 Distributed deadlock detection - CHANDY, MISRA, et al. - 1983
39 Distributed computation on graphs: Shortest path algorithms - Chandy, Misra - 1982
29 Distributed Deadlock Detection Algorithm - Obermarck - 1982
27 On Deadlock Detection in Distributed Systems - Gligor, Shattuck - 1980
27 Locking and Deadlock Detection in Distributed Data Bases - Menasce, Muntz - 1979
18 Termination detection of diffusing computations in communicating sequential processes - Misra, Chandy - 1982
2 Software controlled access to distributed databases - MAHOUD, RIORDAN - 1977
1 The distributed snapshot of - DIJKSTRA - 1984
1 On partially-ordered event models of distributed computations - LAMPORT, CHANDY
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University