eCommons

 

Revisiting the Weakest Failure Detector for Uniform Reliable Broadcast

dc.contributor.authorAguilera, Marcos Kawazoeen_US
dc.contributor.authorToueg, Samen_US
dc.contributor.authorDeianov, Borislaven_US
dc.date.accessioned2007-04-23T18:16:59Z
dc.date.available2007-04-23T18:16:59Z
dc.date.issued1999-04en_US
dc.description.abstractUniform Reliable Broadcast (URB) is a communication primitive that requires that if a process delivers a message, then all correct processes also deliver this message. A recent PODC paper [HR99] uses Knowledge Theory to determine what failure detectors are necessary to implement this primitive in asynchronous systems with process crashes and lossy links that are fair. In this paper, we revisit this problem using a different approach, and provide a result that is simpler, more intuitive, and, in a precise sense, more general.en_US
dc.format.extent238046 bytes
dc.format.extent265769 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR99-1741en_US
dc.identifier.urihttps://hdl.handle.net/1813/7395
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleRevisiting the Weakest Failure Detector for Uniform Reliable Broadcasten_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
99-1741.pdf
Size:
232.47 KB
Format:
Adobe Portable Document Format
No Thumbnail Available
Name:
99-1741.ps
Size:
259.54 KB
Format:
Postscript Files