Replicated distributed programs

Cooper, Eric C.

doi:10.1145/323627.323635

Cited by 81 publications

(9 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This message is sent b y a n agent to respond either to a Collect" or a Begin" message. It is sent when the agent is committed to reject the round speci ed in the received message and has the goal of informing the leader about round r 0 which is the higher numbered round for which the agent is committed to reject round r. 6. Success" messages, m = Success",v i;j .…”

Section: The Codementioning

confidence: 99%

Revisiting the Paxos algorithm

Prisco¹,

Lampson²,

Lynch³

1997

Distributed Algorithms

View full text Add to dashboard Cite

The paxos algorithm is an e cient and highly fault-tolerant algorithm, devised by Lamport, for reaching consensus in a distributed system. Although it appears to be practical, it seems to be not widely known or understood. This thesis contains a new presentation of the paxos algorithm, based on a formal decomposition into several interacting components. It also contains a correctness proof and a time performance and fault-tolerance analysis.The presentation is built upon a general timed automaton GTA model. The correctness proof uses automaton composition and invariant assertion methods. The time performance and fault-tolerance analysis is conditional on the stabilization of the underlying physical system behavior starting from some point in an execution.

show abstract

Section: The Codementioning

confidence: 99%

Revisiting the Paxos algorithm

Prisco¹,

Lampson²,

Lynch³

1997

Distributed Algorithms

View full text Add to dashboard Cite

show abstract

“…Several concepts developed for the support of general-purpose fault tolerance can be adapted to execute in real-time environments. This is the case with broadcast and multicast communication primitives [5] and group memberships when managing replicated procedure calls [6,7] as well as error detection in both control flow errors [8] and functional errors [9].…”

Section: Related Workmentioning

confidence: 99%

FT-AVS: a Fault-tolerant Architecture for Real-Time Active Vision

Fayman¹,

Rivlin²,

Mossé³

1998

Real-Time Imaging

View full text Add to dashboard Cite

“…In another approach, computation itself can be replicated whenever a replicated object is invoked. In the CIRCUS approach [6], when a thread invokes an object having n replicas, n threads are created and each thread executes with a separate replica. Thus, the invocation of a replicated object results in replication of computation.…”

Section: Replicating Objects and Invocationsmentioning

confidence: 99%

Fault-tolerant atomic computations in an object-based distributed system

1990

View full text Add to dashboard Cite

Abstract.A distributed system can s u p p o r t fault-tolerant applications by replicating d a t a a n d c o m p u t a t i o n at nodes that have independent failure modes. W e present a scheme called parallel execution threads (PET) which * This work was supported in part by NSF grants CCR-8619886 and CCR-8806358, and RADC contract number F30602-86-C-0032 His research interests include programming language design and implementation, programming environments, and software engineering. Dr. LeBlanc's current research work involves application of these interests in distributed processing systems. As co-director of the Clouds Project, he is studying language concepts and software engineering methodology for utilizing a highly reliable, object-based distributed system. He is also interested in specification-based software development methodologies and tools. Dr. LeBlanc is a member of the Association for Computing Machinery, the IEEE Computer Society and Sigma Xi.can be used to i m p l e m e n t fault-tolerant c o m p u t a t i o n s in an object-based distributed system. In a system that replicates objects, the P E T scheme can be used to replicate a c o m p u t a t i o n by creating a n u m b e r of parallel threads which execute with different replicas of the inv o k e d objects. A c o m p u t a t i o n can be c o m p l e t e d successfully if at least one t h r e a d does not e n c o u n t e r any failed nodes and its c o m p l e t i o n preserves the consistency of the objects. The P E T scheme can tolerate failures that occur during the execution of the c o m p u t a t i o n as long as all threads are not affected by the failures. W e present the algorithms required to i m p l e m e n t the P E T scheme and also address some performance issues.Key words: F a u l t -t o l e r a n t c o m p u t i n g -A t o m i c i t y -Distributed systems and replication 70

show abstract

Replicated distributed programs

Cited by 81 publications

References 18 publications

Revisiting the Paxos algorithm

Revisiting the Paxos algorithm

FT-AVS: a Fault-tolerant Architecture for Real-Time Active Vision

Fault-tolerant atomic computations in an object-based distributed system

Contact Info

Product

Resources

About