An O(N log22N) fault-tolerant decentralized commit protocol

Shyan Ming Yuan*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A new decentralized commit protocol is proposed for distributed database systems. This protocol can be applied to any size of systems and is [log2 N] - 2 resilient to site failures, where N is the number of sites in the system. In addition, the number of messages sent among N sites is 0(Nlgo22 N) which is only a factor of log2 N over the message complexity lower bound O(N ln N).

Original languageEnglish
Title of host publicationProceedings - Pacific Rim International Symposium on Fault Tolerant Systems, RFTS 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages44-49
Number of pages6
ISBN (Electronic)081862275X, 9780818622755
DOIs
StatePublished - 1 Jan 1991
Event1991 Pacific Rim International Symposium on Fault Tolerant Systems, RFTS 1991 - Kawasaki, Japan
Duration: 26 Sep 199127 Sep 1991

Publication series

NameProceedings - Pacific Rim International Symposium on Fault Tolerant Systems, RFTS 1991

Conference

Conference1991 Pacific Rim International Symposium on Fault Tolerant Systems, RFTS 1991
CountryJapan
CityKawasaki
Period26/09/9127/09/91

Fingerprint Dive into the research topics of 'An O(N log<sup>2</sup><sub>2</sub>N) fault-tolerant decentralized commit protocol'. Together they form a unique fingerprint.

Cite this