what is the state of a channel in a global state?

The authors say that seq is a computation of the system if and only if event ei can occur in global state Si, 0 5 i 5 n, where So is the initial global state andSi+l = neXt(Si, ei) for 0 5 i 5 n.

what is the value of next(S, e)?

The authors define a function next, where next (S, e) is the global state immediately after the occurrence of event e in global state S. The value of next(S, e) is defined only if event e can occur in global state S, in which case next(S, e) is the global state identical to S except that: (1) the state of p in next(S, e) is s’; (2) if e is a channel directed towards p, then the state of c in next(S, e) is c’s state in S with message M deleted from its head; and (3) if c is a channel directed away from p, then the state of c in next(S, e) is the same as c’s state in S with message M added to the tail.

what is the state of ei in seq?

Event ei in seq is called a postrecording event if and only if it is not a prerecording event-that is, if ei is in a process p and p records its state before ei in seq.

What is the effect of q recording its state?

Termination in finite time is ensured if for every process q: q spontaneously records its state or there is a path from a process p, which spontaneously records its state, to q.

What is the q-marker-receiving rule for a process?

For each channel c, incident on, and directed away from p:p sends one marker along c after p records its state and before p sends further messages along c.Marker-Receiving Rule for a Process q.

What is the state-transition diagram for q in Example 2.2?

6. State-transition diagram for process q in Example 2.2.initial globalstate A-state rZstate So1 p sends M S@QBc global state Slq sends M’S,eBD global state S2p receives M’@ADD global state S3A emptyFig.

Open AccessJournal Article10.1145/214451.214456

Distributed snapshots: determining global states of distributed systems

K. Mani Chandy, +1 more

- 01 Feb 1985

- ACM Transactions on Computer Systems

- Vol. 3, Iss: 1, pp 63-75

2.8K

TL;DR: An algorithm by which a process in a distributed system determines a global state of the system during a computation, which helps to solve an important class of problems: stable property detection.

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.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions mentioned in the paper "Distributed snapshots: determining global states of distributed systems" ?

This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation.

2. Why do the authors study the stability detection problem?

The authors study the stability-detection problem because it is a paradigm for many practical problems, such as distributed deadlock detection.

3. What is the simplest way to record a state?

To ensure that the global-state recording algorithm terminates in finite time, each process must ensure that (Ll) no marker remains forever in an incident input channel and (L2) it records its state within finite time of initiation of the algorithm.

4. what is the state of a postrecording event?

There may be a postrecording event ej-1 before a prerecording event ej for some j, L < j < 4; this can occur only if ej-1 and ej are in different processes (because if ej-1 and cj are in the same process and ej-1 is a postrecording event, then so is ej).

Citations

Book Chapter•10.1007/3-540-61626-8_67

A Framework for Viewing Atomic Events in Distributed Computations

Ajay D. Kshemkalyani

- 26 Aug 1996

TL;DR: A unifying framework for expressing and analyzing events at various levels of atomicity in distributed computations is presented and two properties that are satisfied by each level of atoms are identified and proved.

...read moreread less

•Journal Article•10.1016/S0304-3975(97)00195-3

A framework for viewing atomic events in distributed computations

Ajay D. Kshemkalyani

- 06 Apr 1998

TL;DR: A unifying framework for expressing and analyzing events at various levels of atomicity in a distributed computation is presented and three properties that are satisfied by each level of Atomicity are identified and proved.

...read moreread less

Book Chapter•10.1007/3-540-51687-5_47

Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract)

Frank A. Stomp, +1 more

- 26 Sep 1989

TL;DR: In this paper, the authors present a design principle that formally describes how to develop algorithms according to such sequentially phased explanations, which is applicable to large classes of algorithms, such as those for minimum-path, connectivity, network flow, and minimum-weight spanning trees.

...read moreread less

Book Chapter•10.1007/978-3-642-82453-1_11

A Paradigm for Detecting Quiescent Properties in Distributed Computations

K. M. Chandy, +1 more

- 01 Feb 1989

TL;DR: This paper presents a simple (almost trivial) algorithm to detect quiescent properties, an important class of stable properties including those mentioned above.

...read moreread less

Disolver : A Distributed Constraint Solver

Youssef Hamadi

- 01 Dec 2003

TL;DR: Disolver as mentioned in this paper is a C++ constraint-based optimization engine that can be combined with any MPI library, to seamlessly run on parallel architectures, and provides algorithms for satisfaction testing and optimization.

...read moreread less

...

Expand

References

•Journal Article•10.1145/359545.359563

Time, clocks, and the ordering of events in a distributed system

Leslie Lamport

- 01 Jul 1978

- Communications of The ACM

TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.

...read moreread less

9.4K

•Book Chapter•10.1145/3335772.3335934

Time, clocks, and the ordering of events in a distributed system

Leslie Lamport

- 04 Oct 2019

- Concurrency and Computation: Practice an...

TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.

...read moreread less

8.4K

Journal Article•10.1016/0020-0190(80)90021-6

Termination detection for diffusing computations

Edsger W. Dijkstra, +1 more

- 29 Aug 1980

- Information Processing Letters

TL;DR: This invention relates to an electronically rotatable antenna which includes several radially arranged Yagi antennae having a common drive element.

...read moreread less

904

•Journal Article•10.1145/357360.357365

Distributed deadlock detection

K. Mani Chandy, +2 more

- 01 May 1983

- ACM Transactions on Computer Systems

TL;DR: It is shown that all true deadlocks are detected and that no false deadlock reported, and the algorithms can be applied in distributed database and other message communication systems.

...read moreread less

469

•Journal Article•10.1145/357153.357156

Termination Detection of Diffusing Computations in Communicating Sequential Processes

Jayadev Misra, +1 more

- 01 Jan 1982

- ACM Transactions on Programming Language...

TL;DR: In th i s p a p e r, h a v e i n t r o d u c e d t h e n o t i o n of di f fusing computat ion in a d i s t r i b u t e d s y s t e m of p r o c e s s e s a n d sugges t a n e l e g a n t a l g o r i t h m.

...read moreread less

Distributed snapshots: determining global states of distributed systems

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions mentioned in the paper "Distributed snapshots: determining global states of distributed systems" ?

2. Why do the authors study the stability detection problem?

3. What is the simplest way to record a state?

4. what is the state of a postrecording event?

5. what is the state of a channel in a global state?

6. what is the value of next(S, e)?

7. what is the state of ei in seq?

8. What is the effect of q recording its state?

9. What is the q-marker-receiving rule for a process?

10. What is the state-transition diagram for q in Example 2.2?

Citations

A Framework for Viewing Atomic Events in Distributed Computations

A framework for viewing atomic events in distributed computations

Designing Distributed Algorithms by Means of Formal Sequentially Phased Reasoning (Extended Abstract)

A Paradigm for Detecting Quiescent Properties in Distributed Computations

Disolver : A Distributed Constraint Solver

References

Time, clocks, and the ordering of events in a distributed system

Time, clocks, and the ordering of events in a distributed system

Termination detection for diffusing computations

Distributed deadlock detection

Termination Detection of Diffusing Computations in Communicating Sequential Processes

Related Papers (5)

Time, clocks, and the ordering of events in a distributed system

A survey of rollback-recovery protocols in message-passing systems

Checkpointing and Rollback-Recovery for Distributed Systems

System structure for software fault tolerance

On distributed snapshots