TY - JOUR
T1 - Communication complexity of atomic commitment and of gossiping
AU - Wolfson, Ouri
AU - Segall, Adrian
PY - 1991
Y1 - 1991
N2 - The problem of atomic commitment of a transaction in a distributed database is considered. This is a variant of the famous gossiping problem. Given a set of communication costs between pairs of participant sites, it is established that the necessary communication cost for any atomic commitment algorithm is twice the cost of a certain minimum spanning tree. This paper establishes the necessary communication time for any atomic commitment algorithm, given a set of communication delays between pairs of participant sites, and the time at which each participant completes its subtransaction. Then, it is determined that both lower bounds are also upper bounds in the following sense. A simple, linear time, distributed algorithm, called TREE-COMMIT, whose communication complexity is not worse than p times the minimum complexity, where p is the number of participants, is presented. It is demonstrated that TREE-COMMIT is superior to the existing variants of the two-phase commit protocol.
AB - The problem of atomic commitment of a transaction in a distributed database is considered. This is a variant of the famous gossiping problem. Given a set of communication costs between pairs of participant sites, it is established that the necessary communication cost for any atomic commitment algorithm is twice the cost of a certain minimum spanning tree. This paper establishes the necessary communication time for any atomic commitment algorithm, given a set of communication delays between pairs of participant sites, and the time at which each participant completes its subtransaction. Then, it is determined that both lower bounds are also upper bounds in the following sense. A simple, linear time, distributed algorithm, called TREE-COMMIT, whose communication complexity is not worse than p times the minimum complexity, where p is the number of participants, is presented. It is demonstrated that TREE-COMMIT is superior to the existing variants of the two-phase commit protocol.
UR - http://www.scopus.com/inward/record.url?scp=0026169571&partnerID=8YFLogxK
U2 - 10.1137/0220027
DO - 10.1137/0220027
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
SN - 0097-5397
VL - 20
SP - 423
EP - 450
JO - SIAM Journal on Computing
JF - SIAM Journal on Computing
IS - 3
ER -