Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Lamport (1978)
Time, clocks, and the ordering of events in a distributed systemCommun. ACM, 21
M. Chandy, J. Misra (1986)
An example of stepwise refinement of distributed programs: quiescence detectionACM Trans. Program. Lang. Syst., 8
(1985)
The distributed programming language CSSA -- a short introduction
E. Dijkstra, W. Feijen, A. Gasteren (1983)
Derivation of a Termination Detection Algorithm for Distributed ComputationsInf. Process. Lett., 16
KM Chandy, J Misra (1985)
Logics and models of concurrent systems
D Kumar (1985)
5th Conf on Foundations of Software Technology and Theoretical Computer Science, New Delhi
J. Nehmer, D. Haban, F. Mattern, D. Wybranietz, H. Rombach (1987)
Key Concepts of the INCAS Multicomputer ProjectIEEE Transactions on Software Engineering, SE-13
N. Francez, M. Rodeh (1982)
Achieving Distributed Termination without FreezingIEEE Transactions on Software Engineering, SE-8
B. Szymanski, Yuan Shi, N. Prywes (1985)
Synchronized Distributed TerminationIEEE Transactions on Software Engineering, SE-11
B Rozoy (1986)
Proc Math Found Comp Sc 86
KM Chandy, L Lamport (1985)
Distributed snapshots: Determining global states of distributed systemsACM Trans Comput Syst, 3
T-H Lai (1986)
13th Coll Automata, Lang and Programming
J. Hélary, C. Jard, N. Plouzeau, M. Raynal (1987)
Detection of stable properties in distributed applications
I. Lavallée, G. Roucairol (1986)
A Fully Distributed (Minimal) Spanning Tree AlgorithmInf. Process. Lett., 23
H. Müller (1987)
High level Petri nets and distributed termination
J. Misra (1983)
Detecting termination of distributed computations using markers
S. Rana (1983)
A Distributed Solution of the Distributed Termination ProblemInf. Process. Lett., 17
R. Arora, S. Rana, M. Gupta (1986)
Distributed Termination Detection Algorithm for Distributed ComputationsInf. Process. Lett., 22
R. Topor (1984)
Termination Detection for Distributed ComputationsInf. Process. Lett., 18
F. Bauer, E. Dijkstra, C. Hoare (1985)
Control flow and data flow: Concepts of distributed programming
L Bougé (1985)
Symmetry and genericity for CSP in distributed systems
G. Tel, R. Tan, J. Leeuwen (1988)
The Derivation of Graph Marking Algorithms From Distributed Termination Detection ProtocolsSci. Comput. Program., 10
J. Verjus (1987)
On the Proof of a Distributed AlgorithmInf. Process. Lett., 25
L. Bougé (1985)
Repeated Synchronous Snapshots and Their Implementation in CSP (Extended Abstract)
Heikki Saikkonen, S. Rönn (1986)
Distributed termination on a ringBIT Numerical Mathematics, 26
G. Tel, J. Leeuwen (1987)
Comments on “a distributed algorithm for distributed termination”Information Processing Letters, 25
R. Arora, N. Sharma (1983)
A methodology to solve distributed termination problem - A short noteInf. Syst., 8
Dieter Zöbel (1986)
Programmtransformationen zur Ende-Erkennung bei verteilten Berechnungen, 28
D. Ferment, Brigitte Rozoy (1987)
Solutions for the Distributed Termination Problem
E. Dijkstra, C. Scholten (1980)
Termination Detection for Diffusing ComputationsInf. Process. Lett., 11
O. Eriksen, Sven Skyum (1985)
Symmetric Distributed Termination, 14
Brigitte Rozoy (1986)
Model and Complexity of Termination for Distributed Computations
J. Misra, K. Chandy (1982)
Termination Detection of Diffusing Computations in Communicating Sequential ProcessesACM Trans. Program. Lang. Syst., 4
F. Mattern (1987)
Experience with a New Distributed Termination Detection Algorithm
J. Richier (1985)
Distributed Termination in CSP: Symmetric Solutions with Minimal Storage
(1987)
Message-optimal algorithms for termination detection in broadcast networks. Department of Computer and Information Science, The Ohio State University, USA
RK Arora, NK Sharma (1983)
A methodology to solve distributed termination problemInf Syst, 8
Devendra Kumar (1985)
A Class of Termination Detection Algorithms For Distributed Computation
(1985)
Verteilte Terminierung - ein wesentlicher Aspekt der Kontrolle in verteilten Systemen
K. Chandy, J. Misra (1989)
A Paradigm for Detecting Quiescent Properties in Distributed Computations
(1986)
Establishing global assertions in a distributed environment
F. Mattern (1990)
Asynchronous distributed termination—parallel and symmetric solutions with echo algorithmsAlgorithmica, 5
William Clinger (1981)
Foundations of Actor Semantics
G. Roucairol (1987)
On the Construction of Distributed Programs
E. Lozinskii (1985)
A Remark on Distributed Termination
N. Francez (1980)
Distributed TerminationACM Trans. Program. Lang. Syst., 2
K. Apt (1986)
Correctness proofs of distributed termination algorithms
Cyrus Hazari, H. Zedan (1987)
A Distributed Algorithm for Distributed TerminationInf. Process. Lett., 24
N. Shavit, N. Francez (1986)
A New Approach to Detection of Locally Indicative Stability
K. Chandy, J. Misra, L. Haas (1983)
Distributed deadlock detectionACM Trans. Comput. Syst., 1
F. Mattern (1989)
An Efficient Distributed Termination TestInf. Process. Lett., 31
E. Chang (1982)
Echo Algorithms: Depth Parallel Operations on General GraphsIEEE Transactions on Software Engineering, SE-8
Shimon Cohen, D. Lehmann (1982)
Dynamic systems and their distributed termination
EL Lozinskii (1984)
Yet another distributed termination
K. Apt, J. Richier (1986)
Real time clocks versus virtual clocks
R. Tan, J. Leeuwen (1986)
General symmetric distributed termination detection
J-L Richier (1985)
Proc STACS 85
T. Lai (1986)
A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract)
N. Frances, M. Rodeh, M. Sintzoff (1981)
Distributed Termination with Interval Assertions
T. Lai (1986)
Termination Detection for Dynamically Distributed Systems with Non-first-in-first-out CommunicationJ. Parallel Distributed Comput., 3
N Francez, M Rodeh, M Sintzoff (1981)
Proc Int Colloq Formalization of Programming Concepts
Y. Afek, M. Saks (1987)
Detecting global termination conditions in the face of uncertainty
R. Koo, S. Toueg (1987)
Effects of Message Loss on Distributed Termination
K. Chandy (1999)
Snapshots : Determining Global States of Distributed Systems
G. Tel (1987)
Distributed Infimum Approximation
The termination problem for distributed computations is analyzed in the general context of asynchronous communication. In the underlying computational model it is assumed that messages take an arbitrary but finite time and do not necessarily obey the FIFO rule. Time diagrams are used as a graphic means of representing the overall communication scheme, giving a clear insight into the difficulties involved (e.g., lack of global state or time, inconsistent time cuts) and suggesting possible solutions.
Distributed Computing – Springer Journals
Published: May 11, 2005
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.