• DocumentCode
    283848
  • Title

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

  • Author

    Yuan, Shyan-Ming

  • Author_Institution
    Dept. of Comput. & Inf. Sci., Nat. Chiao Tung Univ., Hsinchu, Taiwan
  • fYear
    1991
  • fDate
    26-27 Sep 1991
  • Firstpage
    44
  • Lastpage
    49
  • Abstract
    A new decentralized commit protocol is proposed for distributed database systems. This protocol can be applied to any size of systems and is [log2N]-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 O(N log22N) which is only a factor of log2 N over the message complexity lower bound O (N ln N)
  • Keywords
    computational complexity; database theory; distributed algorithms; distributed databases; fault tolerant computing; protocols; distributed database systems; fault-tolerant decentralized commit protocol; message complexity lower bound; site failures; Database systems; Delay; Distributed databases; Fault tolerance; Fault tolerant systems; Protocols; Transaction databases;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fault Tolerant Systems, 1991. Proceedings., Pacific Rim International Symposium on
  • Conference_Location
    Kawasaki
  • Print_ISBN
    0-8186-2275-X
  • Type

    conf

  • DOI
    10.1109/{RFTS.1991.212967
  • Filename
    212967
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=283848