A fast, scalable mutual exclusion algorithm

@article{Yang1995AFS,
  title={A fast, scalable mutual exclusion algorithm},
  author={Jae-Heon Yang and James H. Anderson},
  journal={Distributed Computing},
  year={1995},
  volume={9},
  pages={51-60}
}
This paper is concerned with synchornization under read/write atomicity in shared memory multi-processors. We present a new algorithm forN-process mutual exclusion that requires only read and write operations and that hasO(logN) time complexity, where “time” is measured by counting remote memory references. The time complexity of this algorithm is better than that of all prior solutions to the mutual exclusion problem that are based upon atomic read and write instructions; in fact, the time… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 104 citations. REVIEW CITATIONS
70 Citations
16 References
Similar Papers

Citations

Publications citing this paper.

105 Citations

051015'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 105 citations based on the available data.

See our FAQ for additional information.

References

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

The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors

  • T. Anderson
  • IEEE Transactions on Parallel and Distributed…
  • 1990
Highly Influential
6 Excerpts

Fast

  • J. Yang, J. Anderson
  • Scalable Synchronization with Minimal Hardware…
  • 1993

How to Write a Proof

  • L. Lamport
  • Research Report 94, Digital Equipment Corporation…
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…