A fast, scalable mutual exclusion algorithm

Abstract

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… (More)
DOI: 10.1007/BF01784242

Topics

4 Figures and Tables

Statistics

051015'96'98'00'02'04'06'08'10'12'14'16'18
Citations per Year

108 Citations

Semantic Scholar estimates that this publication has 108 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@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} }