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/7117
Title: Using Consistent Subcuts for Detecting Stable Properties
Authors: Marzullo, Keith
Sabel, Laura S.
Keywords: computer science
technical report
Issue Date: Apr-1992
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR92-1277
Abstract: We present a general protocol for detecting whether a property holds in a distributed system, where the property is a member of a subclass of stable properties we call the locally stable properties. Our protocol is based on a decentralized method for constructing a maximal subset of the local states that are mutually consistent, which in turn is based on a weakened version of vector time stamps. The structure of our protocol lends itself to refinement, and we demonstrate its utility by deriving some specialized property-detection protocols, including two previously-known protocols that are known to be efficient.
URI: http://hdl.handle.net/1813/7117
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
92-1277.pdf1.83 MBAdobe PDFView/Open
92-1277.ps374 kBPostscriptView/Open

Refworks Export

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

 

© 2014 Cornell University Library Contact Us