Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

The mutual exclusion problem: partII—statement and solutions

The mutual exclusion problem: partII—statement and solutions The theory developed in Part I is used to state the mutual exclusion problem and several additional fairness and failure-tolerance requirements. Four “distributed” N -process solutions are given, ranging from a solution requiring only one communication bit per process that permits individual starvation, to one requiring about N ! communication bits per process that satisfies every reasonable fairness and failure-tolerance requirement that we can conceive of. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of the ACM (JACM) Association for Computing Machinery

The mutual exclusion problem: partII—statement and solutions

Journal of the ACM (JACM) , Volume 33 (2) – Apr 1, 1986

Loading next page...
 
/lp/association-for-computing-machinery/the-mutual-exclusion-problem-partii-statement-and-solutions-EdywxAeOHg

References (22)

Publisher
Association for Computing Machinery
Copyright
Copyright © 1986 by ACM Inc.
ISSN
0004-5411
DOI
10.1145/5383.5385
Publisher site
See Article on Publisher Site

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” N -process solutions are given, ranging from a solution requiring only one communication bit per process that permits individual starvation, to one requiring about N ! communication bits per process that satisfies every reasonable fairness and failure-tolerance requirement that we can conceive of.

Journal

Journal of the ACM (JACM)Association for Computing Machinery

Published: Apr 1, 1986

There are no references for this article.