• DocumentCode
    2500049
  • 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
  • fYear
    1988
  • fDate
    1-5 Feb 1988
  • Firstpage
    51
  • Lastpage
    57
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Data Engineering, 1988. Proceedings. Fourth International Conference on
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    0-8186-0827-7
  • Type

    conf

  • DOI
    10.1109/ICDE.1988.105445
  • Filename
    105445
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2500049