Thumbnail
Access Restriction
Subscribed

Author Lamport, Leslie
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1986
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The theory developed in Part I is used to state the mutual exclusion problem and several additional fairness and failure-tolerance requirements. Four “distributed” $\textit{N}-process$ solutions are given, ranging from a solution requiring only one communication bit per process that permits individual starvation, to one requiring about $\textit{N}!$ communication bits per process that satisfies every reasonable fairness and failure-tolerance requirement that we can conceive of.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1986-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 33
Issue Number 2
Page Count 22
Starting Page 327
Ending Page 348


Open content in new tab

   Open content in new tab
Source: ACM Digital Library