Show simple item record

dc.contributor.authorMarzullo, Keithen_US
dc.contributor.authorSabel, Laura S.en_US
dc.date.accessioned2007-04-23T17:58:34Z
dc.date.available2007-04-23T17:58:34Z
dc.date.issued1992-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR92-1277en_US
dc.identifier.urihttps://hdl.handle.net/1813/7117
dc.description.abstractWe 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.en_US
dc.format.extent1876758 bytes
dc.format.extent382972 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleUsing Consistent Subcuts for Detecting Stable Propertiesen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics