A Time Complexity Bound for Adaptive Mutual Exclusion

@inproceedings{Kim2001ATC,
  title={A Time Complexity Bound for Adaptive Mutual Exclusion},
  author={Yong-Jik Kim and James H. Anderson},
  booktitle={DISC},
  year={2001}
}
We consider the time complexity of adaptive mutual exclusion algorithms, where \time" is measured by counting the number of remote memory references required per critical-section access. We establish a lower bound that precludes a deterministic algorithm with O(log k) time complexity (in fact, any deterministic o(k) algorithm), where k is \point contention." In contrast, we show that expected O(log k) time is possible using randomization. 
Highly Cited
This paper has 44 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

The Complexity of Renaming

2011 IEEE 52nd Annual Symposium on Foundations of Computer Science • 2011
View 12 Excerpts
Highly Influenced

Distributed Computing

Lecture Notes in Computer Science • 2004
View 10 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 20 references

An improved lower bound for the time omplexityof mutual ex lusion

Y. - J. Kim.
To be presented at the 20 th Annual ACM Symposium onPrin iples of Distributed Computing , August • 2001

Bounds on the shared memory requirementsfor long - lived and adaptive obje ts

P. Boxer Y. Afek, D. Touitou.
Pro eedings of the 19 th Annual ACM Symposium on Prin iples of Distributed Computing • 2000

Adaptive solutions to the mutual ex lusion problem

A. Singh.
Distributed Computing • 1994

Similar Papers

Loading similar papers…