Bounds for mutual exclusion with only processor consistency

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1914, Issue , 2000, Pages 44-58

  Higham, Lisa ^a   Kawash, Jalal ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

BAKERY ALGORITHM; LOWER BOUNDS; MEMORY CONSISTENCY MODELS; MUTUAL EXCLUSION ALGORITHMS; MUTUAL EXCLUSIONS; SEQUENTIAL CONSISTENCY; SHARED VARIABLES; WRITE OPERATIONS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79251587710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40026-5_3     Document Type: Conference Paper

References (15)

1. M. Ahamad, R. Bazzi, R. John, P. Kohli, and G. Neiger. The power of processor consistency. In Proc. 5th Int’l Symp. on Parallel Algorithms and Architectures, pages 251–260, June 1993. Technical Report GIT-CC-92/34, College of Computing, Georgia Institute of Technology.
2. H. Attiya, S. Chaudhuri, R. Friedman, and J. L. Welch. Shared memory consistency conditions for non-sequential execution: Definitions and programming strategies. SIAM Journal of Computing, 27(1):65–89, February 1998.
3. J. E. Burns. Symmetry in systems of asynchronous processes. In Proc. 22nd Symp. On Foundations of Computer Science, pages 169–174, 1981.
4. M. Dubois, C. Scheurich, and F. Briggs. Memory access buffering in multiprocessors. In Proc. 13th Int’l Symp. on Computer Architecture, pages 434–442, June 1986.
5. J. Goodman. Cache consistency and sequential consistency. Technical Report 61, IEEE Scalable Coherent Interface Working Group, March 1989.
6. G. J. Holzmann. The model checker SPIN. IEEE Trans. on Software Engineering, 23(5):1–5, May 1997.
7. J. Kawash. Limitations and Capabilities of Weak Memory Consistency Systems. Ph.D. dissertation, Department of Computer Science, The University of Calgary, January 2000.
8. L. Lamport. A new solution of Dijkstra’s concurrent programming problem. Communication of the ACM, 17(8):453–455, August 1974.
9. L. Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. on Computers, C-28(9):690–691, September 1979.
10. L. Lamport. The mutual exclusion problem (parts I and II). Journal of the ACM, 33(2):313–326 and 327–348, April 1986.
11. R. J. Lipton and J. S. Sandberg. PRAM: A scalable shared memory. Technical Report 180-88, Department of Computer Science, Princeton University, September 1988.
12. G. L. Peterson. Myths about the mutual exclusion problem. Information Processing Letters, 12(3):115–116, 1981.
13. M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, 1986.
14. A. Silberschatz and P. B. Galvin. Operating System Concepts. John Wiley & Sons, Inc., 1999.
15. P. M. B. Vitanyi and B. Awerbuch. Atomic shared register access by asynchronous hardware. In Proc. 27th Symp. on Foundations of Computer Science, 1986.