ACHIEVABLE CASES IN AN ASYNCHRONOUS ENVIRONMENT.

Higit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rudiger Reischuk

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

45 Scopus citations

Abstract

Achievability of fault-tolerant goals in a completely asynchronous distributed system is considered. Two pairs of goals are exhibited that are achievable even in the presence of up to t less than n/2 faulty processors, contradicting the widely held assumption that no nontrivial goals are attainable in such a system. The first pair deals with renaming processors so as to reduce the size of the initial name space. When only uniqueness is required of the new names, a lower bound of n plus 1 is shown on the size of the new name space, and a renaming algorithm which establishes an upper bound of n plus t is obtained. In case the new names are required also to preserve the original order, a tight bound of 2**t(n-t plus 1) - 1 is obtained. The second pair of goals deals with the multislot critical section problem. Algorithms for controlled access to a critical section are presented. For the number of slots required, a tight bound of t plus 1 is proved in case the slots are identical.

Original languageEnglish
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages337-346
Number of pages10
ISBN (Print)0818608072, 9780818608070
DOIs
StatePublished - 1987
Externally publishedYes

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

Fingerprint

Dive into the research topics of 'ACHIEVABLE CASES IN AN ASYNCHRONOUS ENVIRONMENT.'. Together they form a unique fingerprint.

Cite this