DocumentCode :
2387714
Title :
A class of optimal decentralized commit protocols
Author :
Yuan, Shyan-Ming ; Agrawala, Ashok K.
Author_Institution :
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
fYear :
1988
fDate :
13-17 Jun 1988
Firstpage :
234
Lastpage :
241
Abstract :
The message complexity of decentralized commit protocols is studied. It is shown that O(kNN1k/) messages are necessary if only k rounds of message interchanges are allowed. It is also shown that O(Nln N) is a message lower bound for any decentralized commit protocol. A class of decentralized commit protocols that need O(kNN1k/) messages and use k rounds of message interchanges is proposed. If k=ln N, then a decentralized commit protocol that needs O(Nln N) messages only is obtained. The communication scheme is also used to derive some decentralized consensus protocols
Keywords :
finite automata; protocols; O(kNN1k/) messages; decentralized consensus protocols; finite state automata; message complexity; message interchanges; optimal decentralized commit protocols; transaction execution; Automation; Computer science; Concurrent computing; Educational institutions; Protocols; Writing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems, 1988., 8th International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
0-8186-0865-X
Type :
conf
DOI :
10.1109/DCS.1988.12522
Filename :
12522
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2387714
بازگشت