Initial failures in distributed computations

DOI10.1007/BF01407859zbMath0702.68029OpenAlexW1975495174MaRDI QIDQ915424

Shlomo Moran, Shmuel Katz, Gadi Taubenfeld

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

modellingdistributed systemcrash failureswinning strategyasynchronous message passing systemsasynchronous protocolsinitial failures

Mathematics Subject Classification ID

Related Items (8)

Simple and optimal randomized fault-tolerant rumor spreading ⋮ Possibility and impossibility results in a shared memory environment ⋮ 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 ⋮ Hundreds of impossibility results for distributed computing ⋮ Tight bounds on the round complexity of distributed 1-solvable tasks ⋮ Contention-related crash failures: definitions, agreement algorithms, and impossibility results

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How processes learn
• Possibility and impossibility results in a shared memory environment
• Fault-tolerant distributed algorithm for election in complete networks
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus

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