Shared-memory mutual exclusion: major research trends since 1986

@article{Anderson2003SharedmemoryME,
  title={Shared-memory mutual exclusion: major research trends since 1986},
  author={J. Anderson and Yong-Jik Kim and T. Herman},
  journal={Distributed Computing},
  year={2003},
  volume={16},
  pages={75-110}
}
  • J. Anderson, Yong-Jik Kim, T. Herman
  • Published 2003
  • Engineering, Computer Science
  • Distributed Computing
    • Abstract.In 1986, Michel Raynal published a comprehensive survey of algorithms for mutual exclusion [72]. In this paper, we survey major research trends since 1986 in work on shared-memory mutual exclusion. 
    View on Springer
    cs.unc.edu
    108 Citations
    Highly Influencial Citations
    10
    Background Citations
    54
    Methods Citations
    23
    108 Citations
    Citation Type

    Citation Type

    Caches, Transactions and Memories: Models, Coherence and Consistency
    Transformations of Mutual Exclusion Algorithms from the Cache-Coherent Model to the Distributed Shared Memory Model
    • Hyonho Lee
    • Computer Science
    • 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05)
    • 2005
    • 13
    • PDF
    Time complexity bounds for shared-memory mutual exclusion
    • 1
    • PDF
    A fair and space-efficient mutual exclusion
    • S. Chen, T. Huang
    • Computer Science
    • 11th International Conference on Parallel and Distributed Systems (ICPADS'05)
    • 2005
    • 2
    Closing the complexity gap between mutual exclusion and FCFS mutual exclusion
    • 5
    • PDF
    A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
    A mutual exclusion algorithm with optimally bounded bypasses
    • 8
    • PDF
    ACM SIGACT news distributed computing column 13
    Adaptive randomized mutual exclusion in sub-logarithmic expected time
    • 17
    • PDF
    A queue based mutual exclusion algorithm
    • 9
    • PDF

    References

    SHOWING 1-10 OF 91 REFERENCES
    Bounds on Shared Memory for Mutual Exclusion
    • 131
    • Highly Influential
    • PDF
    A Comment on "A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors"
    • 11
    A fast mutual exclusion algorithm
    • 522
    • Highly Influential
    • PDF
    Speeding Lamport's Fast Mutual Exclusion Algorithm
    • 48
    • PDF
    A Time Complexity Bound for Adaptive Mutual Exclusion
    • 44
    • PDF
    Mutual exclusion with linear waiting using binary shared variables
    • 39
    • Highly Influential
    An improved lower bound for the time complexity of mutual exclusion
    • 45
    Mutual exclusion revisited
    • B. Szymanski
    • Computer Science
    • Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'
    • 1990
    • 23
    • PDF
    Contention in shared memory algorithms
    • 74
    A Circular List-Based Mutual Exclusion Scheme for Large Shared-Memory Multiprocessors
    • 19
    • PDF