TY - CHAP
T1 - Emulating shared-memory do-all algorithms in asynchronous message-passing systems
AU - Kowalski, Dariusz R.
AU - Momenzadeh, Mariam
AU - Shvartsman, Alexander A.
PY - 2004
Y1 - 2004
N2 - A fundamental problem in distributed computing is performing a set of tasks despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processors. This paper studies the efficiency of emulating shared-memory task-performing algorithms on asynchronous message-passing processors with quantifiable message latency. Efficiency is measured in terms of work and communication, and the challenge is to obtain subquadratic work and message complexity. While prior solutions assumed synchrony and constant delays, the solutions given here yields subquadratic efficiency with asynchronous processors when the delays and failures is suitably constrained. The solutions replicate shared objects using a quorum system, provided it is not disabled. One algorithm has subquadratic work and communication when the delays and the number of processors, K, owning object replicas, are O(P0.41). It tolerates [K-1/2] crashes. It is also shown that there exists an algorithm that has subquadratic work and communication and that tolerates o(P) failures, provided message delays are sublinear. quorums.
AB - A fundamental problem in distributed computing is performing a set of tasks despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processors. This paper studies the efficiency of emulating shared-memory task-performing algorithms on asynchronous message-passing processors with quantifiable message latency. Efficiency is measured in terms of work and communication, and the challenge is to obtain subquadratic work and message complexity. While prior solutions assumed synchrony and constant delays, the solutions given here yields subquadratic efficiency with asynchronous processors when the delays and failures is suitably constrained. The solutions replicate shared objects using a quorum system, provided it is not disabled. One algorithm has subquadratic work and communication when the delays and the number of processors, K, owning object replicas, are O(P0.41). It tolerates [K-1/2] crashes. It is also shown that there exists an algorithm that has subquadratic work and communication and that tolerates o(P) failures, provided message delays are sublinear. quorums.
KW - Communication
KW - Distributed algorithm
KW - Fault-tolerance
KW - Work
UR - http://www.scopus.com/inward/record.url?scp=27744550915&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=27744550915&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-27860-3_20
DO - 10.1007/978-3-540-27860-3_20
M3 - Chapter
AN - SCOPUS:27744550915
SN - 3540226672
SN - 9783540226673
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 210
EP - 222
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
A2 - Papatriantafilou, Marina
A2 - Hunel, Philippe
PB - Springer Verlag
ER -