Show simple item record

dc.contributor.authorBasu, Anindyaen_US
dc.contributor.authorCharron-Bost, Bernadetteen_US
dc.contributor.authorToueg, Samen_US
dc.date.accessioned2007-04-23T18:08:19Z
dc.date.available2007-04-23T18:08:19Z
dc.date.issued1996-09en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR96-1609en_US
dc.identifier.urihttps://hdl.handle.net/1813/7264
dc.description.abstractWe study the effect of link failures on the solvability of problems in asynchronous systems that are subject to process crashes: given a problem that can be solved in a system with process crashes and reliable links, is the problem solvable even if links are lossy? We answer this question for two types of lossy links, and show that the answer depends on the maximum number of processes that may crash and the nature of the problem to be solved. In particular, we prove that the answer is positive if fewer than half of the processes may crash or if the problem specification does not refer to the state of processes that crash. However, in general, the answer is negative even if each link can loose only a finite number of messages.en_US
dc.format.extent324448 bytes
dc.format.extent304829 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.titleSolving Problems in the Presence of Process Crashes and Lossy Linksen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics