Reducing the cost for non-blocking in atomic commitment

Non-blocking atomic commitment protocols enable a decision (commit or abort) to be reached at every correct participant, despite the failure of others. The cost for non-blocking implies however (1) a high number of messages and communication steps required to reach commit, and (2) a complicated term...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the 16th International Conference on Distributed Computing Systems s. 692 - 697
Hlavní autoři: Guerraoui, R., Larrea, M., Schiper, A.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1996
Témata:
ISBN:9780818673993, 0818673990
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Non-blocking atomic commitment protocols enable a decision (commit or abort) to be reached at every correct participant, despite the failure of others. The cost for non-blocking implies however (1) a high number of messages and communication steps required to reach commit, and (2) a complicated termination protocol needed in the case of failure suspicions. In this paper, we present a non-blocking protocol, called MDSPC (Modular and Decentralized Three Phase Commit), which enables to trade resiliency against efficiency. As conveyed by our performance measures, MDSPC is faster than existing non-blocking protocols, and in the case of a broadcast network and a reasonable resiliency rate (e.g. 2 or 3) is almost as efficient as the classical (blocking) 2PC. The termination protocol of MDSPC is encapsulated inside a majority consensus protocol. This modularity leads to a simple structure of MDSPC and enables a precise characterization of its liveness in an asynchronous system with an unreliable failure detector.
AbstractList Non-blocking atomic commitment protocols enable a decision (commit or abort) to be reached at every correct participant, despite the failure of others. The cost for non-blocking implies however (1) a high number of messages and communication steps required to reach commit, and (2) a complicated termination protocol needed in the case of failure suspicions. In this paper, we present a non-blocking protocol, called MDSPC (Modular and Decentralized Three Phase Commit), which enables to trade resiliency against efficiency. As conveyed by our performance measures, MDSPC is faster than existing non-blocking protocols, and in the case of a broadcast network and a reasonable resiliency rate (e.g. 2 or 3) is almost as efficient as the classical (blocking) 2PC. The termination protocol of MDSPC is encapsulated inside a majority consensus protocol. This modularity leads to a simple structure of MDSPC and enables a precise characterization of its liveness in an asynchronous system with an unreliable failure detector.
Author Guerraoui, R.
Larrea, M.
Schiper, A.
Author_xml – sequence: 1
  givenname: R.
  surname: Guerraoui
  fullname: Guerraoui, R.
  organization: Dept. d'Inf., Ecole Polytech. Federale de Lausanne, Switzerland
– sequence: 2
  givenname: M.
  surname: Larrea
  fullname: Larrea, M.
  organization: Dept. d'Inf., Ecole Polytech. Federale de Lausanne, Switzerland
– sequence: 3
  givenname: A.
  surname: Schiper
  fullname: Schiper, A.
  organization: Dept. d'Inf., Ecole Polytech. Federale de Lausanne, Switzerland
BookMark eNotj8FKxDAUAAMqqGs_QE_9gdb3mjTNO0rVdWFB2NXzkqYvGt200saDf-_KeprDwMBcitNhHFiIa4QSEeh21d632xKJdFmDgQpPREaNAYNGN5JInotsnj8AAEkT1Hghmg333y4Mb3l659yNc8r9OOWHcNHtR_f5Z8KQ2zTG4A4-xpAiD-lKnHm7nzn750K8Pj68tE_F-nm5au_WRUBQqeh95Vl1nrUHCYZt75RqwFrneiQw1HjdeYVWkTbOO8PK9Z2sK-x8bRHkQtwcu4GZd19TiHb62R3v5C9rqUez
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICDCS.1996.508021
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 697
ExternalDocumentID 508021
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIE
RIL
ID FETCH-LOGICAL-i104t-df2fe4bfe6f0308eadc4470aaccd190897f6bf41a4968cfc8e4cdb3521bf5a103
IEDL.DBID RIE
ISBN 9780818673993
0818673990
ISICitedReferencesCount 18
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=508021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 17:13:40 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-df2fe4bfe6f0308eadc4470aaccd190897f6bf41a4968cfc8e4cdb3521bf5a103
PageCount 6
ParticipantIDs ieee_primary_508021
PublicationCentury 1900
PublicationDate 19960000
PublicationDateYYYYMMDD 1996-01-01
PublicationDate_xml – year: 1996
  text: 19960000
PublicationDecade 1990
PublicationTitle Proceedings of the 16th International Conference on Distributed Computing Systems
PublicationTitleAbbrev ICDCS
PublicationYear 1996
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0001969051
Score 1.4252754
Snippet Non-blocking atomic commitment protocols enable a decision (commit or abort) to be reached at every correct participant, despite the failure of others. The...
SourceID ieee
SourceType Publisher
StartPage 692
SubjectTerms Broadcasting
Computer crashes
Contracts
Costs
Delay
Detectors
Nominations and elections
Protocols
Title Reducing the cost for non-blocking in atomic commitment
URI https://ieeexplore.ieee.org/document/508021
WOSCitedRecordID wos508021&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFLagYmAqlCJueWB1GydOnMyBCiRUVVzqVvl4ljK0RW3a38-zE1ohsbD5UmI5sd75fY-Qe8uTVEKumY4kMJELYEVqNZOFVhkYJZOQVfn5IsfjfDotJi3PdsDCAEBIPoOBb4ZYvl2ajXeVDVMPDEVT51BK2UC19u6UIvNMU4Hh0XO0odxtGZ12_aQNavKoGD6XD-WbR-plg-ahv4qrBNky6v5rVyekv8fo0clO-pySA1j0SPenSANt7-wZka-enBWXUFT1qFmua4p6KkWrn2kUZN5TTqsFRdt7Xhmcn8-rkHjeJx-jx_fyibXVEliFJlXNrIsdCO0gc56DBv8QI4SMlDLGch_dky7TTnAliiw3zuQgjNWof3HtUsWj5Jx08N1wQSgovOs4nadxJGyiFcSGW0_dlnKtpL0kPX8Ms6-GEGPWnMDVn6PX5LhJdPZeixvSqVcbuCVHZltX69Vd-Ijf4eGahw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LT8IwGG8MmugJRYxve_BaWLd23c6ogYiEKBpupI-vyQ6AgeHfb9tNiIkXb31la7o13_P3-xC6NzThAjJFVCSAsIwByblRRORKpqClSEJW5cdQjEbZdJqPa57tgIUBgJB8Bh3fDLF8s9Qb7yrrcg8MdabOPmcsphVYa-dQyVPPNRU4Hj1Lm5O8NafTtp_UYU0a5d1B76H35rF6aad67K_yKkG6PDX_ta9j1N6h9PB4K39O0B4sWqj5U6YB17f2FIlXT8_qlmCn7GG9XJfYaarY2f1EOVHmfeW4WGBnfc8L7ebn8yKknrfR-9PjpNcndb0EUjijqiTGxhaYspBaz0Lj_hHNmIik1NpQH98TNlWWUcnyNNNWZ8C0UU4Do8pySaPkDDXcu-EcYZDutrvpjMcRM4mSEGtqPHkbp0oKc4Fa_hhmnxUlxqw6gcs_R-_QYX_yMpwNB6PnK3RUpT17H8Y1apSrDdygA_1VFuvVbfig3x7rnc4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+16th+International+Conference+on+Distributed+Computing+Systems&rft.atitle=Reducing+the+cost+for+non-blocking+in+atomic+commitment&rft.au=Guerraoui%2C+R.&rft.au=Larrea%2C+M.&rft.au=Schiper%2C+A.&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780818673993&rft.spage=692&rft.epage=697&rft_id=info:doi/10.1109%2FICDCS.1996.508021&rft.externalDocID=508021
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818673993/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818673993/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818673993/sc.gif&client=summon&freeimage=true