Accession Number:

ADA183373

Title:

A Class of Optimal Decentralized Commit Protocols.

Descriptive Note:

Technical rept.,

Corporate Author:

MARYLAND UNIV COLLEGE PARK DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Agrawala,Ashok K.
• Yuan,Shyan-Ming

Report Date:

1987-07-01

Pagination or Media Count:

24.0

Abstract:

This paper studies the message complexity of decentralized commit protocols. It shows that Theta kNN to the 1k power messages are necessary only if k rounds of message interchanges are allowed. It also shows that Theta n1nN is a message lower bound for any decentralized commit protocol. Finally, a class of decentralized commit protocols are proposed which need Theta kNN to the 1k power messages and use k rounds of message interchanges. If we let k1nN then we can get a decentralized commit protocol which needs Theta N1nN messages only.

Descriptors:

• *MESSAGE PROCESSING
• TELECOMMUNICATIONS
• METHODOLOGY
• DECENTRALIZATION

Subject Categories:

• Command, Control and Communications Systems

Distribution Statement:

APPROVED FOR PUBLIC RELEASE