Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7211
Title: Deciding in Partitionable Networks
Authors: Friedman, Roy
Keidar, Idit
Malki, Dalia
Birman, Ken
Dolev, Danny
Keywords: computer science
technical report
Issue Date: Nov-1995
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1554
Abstract: Motivated by Chandra and Toueg's work, we study decision protocols in a model that closely approximates "real" distributed systems. Our results show how the weakest failure detector and associated consensus algorithm can be adapted to a network in which omission failures can occur during periods when processes suspect one-another as faulty. For protocols in which a majority subset of the participants can reach decisions on behalf of the system as a whole, we also characterize a series of stages that necessarily arise during execution. Jointly, these findings establish a direct relationship between an extended version of the three-phase commit protocol, which makes progress even when a traditional three-phase commit would block, and the consensus protocol of Chandra and Toueg. Although we do not explore the linkage here, our results should also be applicable to other agreement protocols for systems of this sort, such as leader election and dynamic group membership.
URI: http://hdl.handle.net/1813/7211
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
95-1554.pdf231.44 kBAdobe PDFView/Open
95-1554.ps194.8 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us