Title :
Optimal communication topologies for atomic commitment
Author :
Segall, Adrian ; Wolfson, Ouri
Author_Institution :
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
Abstract :
The authors consider distributed algorithms that achieve transaction commitment at minimal communication cost but differ in the time it takes them to reach consensus. Based on this criterion, the authors define a `better than´ partial ranking of minimal-communication-cost algorithms. They also discuss alternatives of a simple, minimal-communication-cost algorithm introduced previously, called TREE-COMMIT
Keywords :
distributed databases; TREE-COMMIT; atomic commitment; distributed algorithms; minimal-communication-cost algorithms; optimal communication topologies; transaction commitment; Algorithm design and analysis; Communication networks; Computer science; Costs; Delay effects; Distributed databases; Network topology; Protocols; Transaction databases; Voting;
Conference_Titel :
Data Engineering, 1988. Proceedings. Fourth International Conference on
Conference_Location :
Los Angeles, CA
Print_ISBN :
0-8186-0827-7
DOI :
10.1109/ICDE.1988.105445
