Time bounds for mutual exclusion and related problems

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129502, Issue , 1994, Pages 224-233

  Yang, Jae Heon ^a   Anderson, James H ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY ARCHITECTURE; ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; MULTIPROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS SHARED MEMORY; CACHING TECHNIQUE; COMPARE AND SWAPS; CONCURRENT PROGRAM; LEADER ELECTION PROBLEM; MUTUAL EXCLUSION ALGORITHMS; REMOTE MEMORY REFERENCES; SYNCHRONIZATION PRIMITIVE;

ECONOMIC AND SOCIAL EFFECTS; DATA REDUCTION;

ASYNCHRONOUS SHARED MEMORY MULTIPROCESSING SYSTEMS; MUTUAL EXCLUSION; TIME BOUNDS;

EID: 0028126123     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/195058.195139     Document Type: Conference Paper

References (14)

1. R. Alur and G. Taubenfeld, "Results about Fast Mutual Exclusion", Proceedings of the Thirteenth IEEE Real-Time Systems Symposium, December, 1992, pp. 12-21.
2. J. Anderson, "A Fine-Grained Solution to the Mutual Exclusion Problem", Acta Informatica, Vol. 30, No. 3, 1993, pp. 249-265.
3. T. Anderson, "The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors", IEEE Transactions on Parallel and Distributed Systems, Vol. 1, No. 1, January, 1990, pp. 6-16.
4. E. Dijkstra, "Solution of a Problem in Concurrent Programming Control", Communications of the ACM, Vol. 8, No. 9, 1965, pp. 569.
5. C. Dwork, M. Herlihy, and O. Waarts, "Contention in Shared Memory Algorithms", Proceedings of the 25th ACM Symposium on Theory of Computing, May, 1993, pp. 174-183.
6. M. Herlihy, "Wait-Free Synchronization", ACM Transactions on Programming Languages and Systems, Vol. 13, No. 1, 1991, pp. 124-149.
7. M. Herlihy, B-H. Lim, and N. Shavit, "Low Contention Load Balancing on Large-Scale Multiprocessors", Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, July, 1992, pp. 219-227.
8. M. Herlihy, N. Shavit, and O. Waarts, "Low Contention Linearizable Counting", Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, October, 1991, pp. 526-535.
9. L. Lamport, "A Fast Mutual Exclusion Algorithm", ACM Transactions on Computer Systems, Vol. 5, No. 1, February, 1987, pp. 1-11.
10. N. Lynch and N. Shavit, "Timing-Based Mutual Exclusion", Proceedings of the Thirteenth IEEE Real-Time Systems Symposium, December, 1992, pp. 2-11.
11. J. Mellor-Crummey and M. Scott, "Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors", A CM Transactions on Computer Systems, Vol. 9, No. 1, February, 1991, pp. 21-65.
12. M. Merritt and G. Taubenfeld, "Knowledge in Shared Memory Systems", Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, August, 1991, pp. 189-200.
13. G. Pfister and A. Norton, "Hot Spot Contention and Combining in Multistage Interconnection Networks", IEEE Transactions on Computers, Vol. C- 34, No. 11, November, 1985, pp. 943-948.
14. J. Yang and J. Anderson, "Fast, Scalable Synchronization with Minimal Hardware Support", Proceedings of the Twelfth ACM Symposium on Principles of Distributed Computing, August, 1993, pp. 171-182.