Initial failures in distributed computations

DOI10.1007/BF01407859MaRDI QIDQ915424zbMATH OpenOpenAlexFDO

Authors Gadi Taubenfeld, Shmuel Katz, Shlomo Moran

Publication date 1989

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01407859

zbMATH Keywords

asynchronous message passing systemsasynchronous protocolscrash failuresdistributed systeminitial failuresmodellingwinning strategy

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Possibility and impossibility results in a shared memory environment
• Distributed computability in Byzantine asynchronous systems
• The weakest failure detectors to solve certain fundamental problems in distributed computing
• Impossibility of distributed consensus with one faulty process
• What can be computed in a distributed system?

Cites work

• Fault-tolerant distributed algorithm for election in complete networks
• How processes learn
• scientific article; zbMATH DE number 3885853 (Why is no real title available?)
• scientific article; zbMATH DE number 4205964 (Why is no real title available?)
• scientific article; zbMATH DE number 3990855 (Why is no real title available?)
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus
• Possibility and impossibility results in a shared memory environment

Cited in

(16)

• Possibility and impossibility results in a shared memory environment
• Contention-related crash failures: definitions, agreement algorithms, and impossibility results
• Simple and optimal randomized fault-tolerant rumor spreading
• scientific article; zbMATH DE number 4205964 (Why is no real title available?)
• Distributed processes and location failures
• scientific article; zbMATH DE number 1569121 (Why is no real title available?)
• A simple characterization of asynchronous computations
• Hundreds of impossibility results for distributed computing
• What can be computed in a distributed system?
• Distributed processes and location failures
• Reaching agreement in the presence of contention-related crash failures
• Reaching consensus in the presence of contention-related crash failures
• On the Validity of Consensus
• Tight bounds on the round complexity of distributed 1-solvable tasks
• Team formation and applications
• On the minimum requirements for independent recovery in distributed systems

This page was built for publication: Initial failures in distributed computations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q915424)