A fine-grained solution to the mutual exclusion problem-Reference-Cited by-同舟云学术

A fine-grained solution to the mutual exclusion problem

Published:1993-03 Issue:3 Volume:30 Page:249-265
ISSN:0001-5903
Container-title:Acta Informatica
language:en
Short-container-title:Acta Informatica

Author:

Anderson James H.

Publisher

Springer Science and Business Media LLC

Subject

Computer Networks and Communications,Information Systems,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01179373.pdf

Reference11 articles.

1. Anderson, J., Gouda, M.: Atomic semantics of nonatomic programs. Inf. Process. Lett.28, 99?103 (1988)

2. Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Inf. Comput. to appear. Originally appeared as: Mutual exclusion using indivisible reads and writes. Proceedings of the 18th Allerton Conference on Communication, Control, and Computing, October 1980, pp. 833?842

3. Dijkstra, E.: Solution of a problem in concurrent programming control. Commun. ACM8(9), 569 (1965)

4. Dijkstra, E.: A discipline of programming. Englewood Cliffs, NJ: Prentice-Hall 1976

5. Kessels, J.: Arbitration without common modifiable variables. Acta Inf.17, 135?141 (1982)

Cited by 14 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mellor-Crummey and Scott Mutual Exclusion Algorithm;Encyclopedia of Algorithms;2016

2. Mellor-Crummey and Scott Mutual Exclusion Algorithm;Encyclopedia of Algorithms;2015

3. Multicore Software Development for Embedded Systems;Software Engineering for Embedded Systems;2013

4. Nonatomic dual bakery algorithm with bounded tokens;Acta Informatica;2011-02-16

5. An $O(1)$ RMRs Leader Election Algorithm;SIAM Journal on Computing;2010-01