Linearizable read/write objects

Theoretical Computer Science

Volumn 220, Issue 1, 1999, Pages 267-319

  Mavronicolas, Marios ^a   Roth, Dan ^b  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0141440745     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)90244-4     Document Type: Article

References (54)

1. S. Adve, M. Hill, A unified formalization of four shared-memory models, IEEE Trans. Parallel Distrib. Systems 4 (6) (1993) 613-624.
2. S. Adve, K. Gharachorloo, Shared memory consistency models: a tutorial, Computer 29 (12) (1996) 66-76.
3. Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, N. Shavit, Atomic snapshots of shared memory, J. ACM 40 (4) (1993) 873-890.
4. Y. Afek, G. Brown, M. Merritt, Lazy caching, ACM Trans. Programming Languages Systems 15 (1) (1993) 182-205.
5. D. Agrawal, M. Choy, H.V. Leong, A.K. Singh, Mixed consistency: a model for parallel programming, Proc. 13th Annu. ACM Symp. on Principles of Distributed Computing, August 1994, pp. 101-110.
6. M. Ahamad, R. Bazzi, R. John, P. Kohli, G. Neiger, The power of processor consistency, Proc. 5th Annu. ACM Symp. on Parallel Algorithms and Architectures, June/July 1993, pp. 251-260.
7. M. Ahamad, J. Burns, P. Hutto, G. Neiger, Causal memory, Distrib. Comput. 9 (1995) 37-49.
8. M. Ahamad, P. Hutto, R. John, Implementing and programming causal distributed shared memory, Proc. 11th Internat. Conf. on Distributed Computing Systems, May 1991, pp. 274-281.
9. R. Alur, K. McMillan, D. Peled, Model-checking of correctness conditions for concurrent objects, Proc. 11th Annual IEEE Symp. on Logic in Computer Science, July 1996, pp. 219-228.
10. H. Attiya, Implementing FIFO queues and stacks, in: S. Toueg, P.G. Spirakis, L. Kirousis (Eds.), Proc. 5th Internat. Workshop on Distributed Algorithms (WDAG'91), Lecture Notes in Computer Science, vol. 579, Springer, Berlin, 1991, pp. 80-94.
11. H. Attiya, S. Chaudhuri, R. Friedman, J.L. Welch, Shared memory consistency conditions for non-sequential execution: definitions and programming strategies, SIAM J. Comput. 27 (1) (1998) 65-89.
12. H. Attiya, R. Friedman, A correctness condition for high-performance multiprocessors, Proc. 24th Annu. ACM Symp. on Theory of Computing, May 1992, pp. 679-690.
13. H. Attiya, R. Friedman, Programming DEC-alpha based multiprocessors the easy way, Proc. 6th Annu. ACM Symp. on Parallel Algorithms and Architectures, June 1994, pp. 157-166.
14. H. Attiya, R. Friedman, Limitations of fast consistency conditions for distributed shared memory, Inform. Process. Lett. 57 (5) (1996) 243-248.
15. H. Attiya, J.L. Welch, Sequential consistency versus linearizability, ACM Trans. Comput. Systems 12 (2) (1994) 91-122. Preliminary version: Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures, July 1991, pp. 304-315.
16. H. Attiya, J.L. Welch, Sequential consistency versus linearizability, ACM Trans. Comput. Systems 12 (2) (1994) 91-122. Preliminary version: Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures, July 1991, pp. 304-315.
17. H. Attiya, J.L. Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, New York, 1998.
18. H. Bal, M. Kaashoek, A. Tanenbaum, Orca: a language for parallel programming of distributed systems, IEEE Trans. Software Eng. 18 (3) (1992) 190-205.
19. P. Bernstein, V. Hadzilacos, H. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, MA, 1987.
20. K. Birman, T. Joseph, Reliable communication in the presence of failures, ACM Trans. Comput. Systems 5 (1) (1990) 47-76.
21. S. Chaudhuri, R. Gawlick, N. Lynch, Designing algorithms for distributed systems using partially synchronized clocks, Proc. 12th Annu. ACM Symp. on Principles of Distributed Computing, August 1993, pp. 121-132.
22. B. Coan, G. Thomas, Agreeing on a leader in real time, Proc. 11th IEEE Real-Time Systems Symp., December 1990, pp. 166-172.
23. M. Eleftheriou, M. Mavronicolas, Linearizability in the presence of partial synchrony and under different delay assumptions, Preprint, Department of Computer Science, University of Cyprus, February 1998.
24. Encore 91 Series Technical Summary, 1991.
25. A. Fekete, F. Kaashoek, N. Lynch, Providing sequentially consistent shared objects using group and point-to-point communication, J. ACM 45 (1) (1998) 35-69.
26. R. Friedman, Implementing high-level synchronization operations in hybrid consistency, Distrib. Comput. 9 (3) (1995) 119-129.
27. K. Gharachorloo, P. Gibbons, Detecting violations of sequential consistency, Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures, June 1991, pp. 316-326.
28. P. Gibbons, E. Korach, On testing cache-coherent shared memories, Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures, June 1994, pp. 177-188.
29. P. Gibbons, M. Merritt, Specifying non-blocking shared memories, Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures, July 1992, pp. 292-303.
30. P. Gibbons, M. Merritt, M. Gharachorloo, Proving sequential consistency of high-performance shared memories, Proc. 3rd Annu. ACM Symp. on Parallel Algorithms and Architectures, June 1991, pp. 292-303.
31. J. Halpern, N. Megiddo, A. Munshi, Optimal precision in the presence of uncertainty, J. Complexity 1 (1985) 170-196.
32. M. Herlihy, Wait-free implementations of concurrent objects, Proc. 7th Annu. ACM Symp. on Principles of Distributed Computing, August 1988, pp. 276-290.
33. M. Herlihy, J. Wing, Linearizability: a correctness condition for concurrent objects, ACM Trans. Programming Languages Systems 12 (3) (1990) 463-492.
34. P. Hutto, M. Ahamad, Slow memory: weakening consistency to enhance concurrency in distributed shared memories, Proc. 10th Internat. Conf. on Distributed Computing Systems, May 1990, pp. 302-311.
35. M. Inoue, T. Masuzawa, N. Tokura, Efficient linearizable implementation of shared FIFO queues and general objects on a distributed system, IEICE Trans. Fundamentals of Electronics, Communications, and Computer Sciences E81A (5) (1998) 768-775.
36. J. James, A.K. Singh, Fault tolerance bounds for memory consistency, in: M. Mavronicolas, Ph. Tsigas (Eds.), Proc. 11th Internat. Workshop on Distributed Algorithms (WDAG-97), Lecture Notes in Computer Science, vol. 1320, Springer, Saarbrücken, Germany, September 1997, pp. 200-214.
37. H. Kopetz, W. Ochsenreiter, Clock synchronization in distributed real-time systems, IEEE Trans. Computers C-36 (8) (1987) 933-939.
38. M.J. Kosa, Making operations of concurrent data types fast, Proc. 13th Annu. ACM Symp. on Principles of Distributed Computing, August 1994, pp. 32-41.
39. L. Lamport, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. Computers C-28 (9) (1979) 690-691.
40. L. Lamport, On interprocess communication, parts I and II, Distrib. Comput. 1 (2) (1986) 77-101.
41. L. Lamport, How to make a correct multiprocess program execute correctly on a Multiprocessor, DEC SRC Research Report # 96, February 14, 1993.
42. R. Lipton, J. Sandberg, A scalable shared memory, Technical Report CS-TR-180-88, Princeton University, September 1988.
43. B. Liskov, Practical uses of synchronized clocks in distributed systems, Distrib. Comput. 6 (1993) 211-219.
44. V. Luchangco, Precedence-based memory models, in: M. Mavronicolas, Ph. Tsigas (Eds.), Proc. 11th Internat. Workshop on Distributed Algorithms (WDAG-97), Lecture Notes in Computer Science, vol. 1320, Springer, Saarbrücken, Germany, September 1997, pp. 215-229.
45. J. Lundelius, N. Lynch, An upper and lower bound for clock synchronization, Inform, and Control 62 (2/3) (1984) 190-204.
46. N. Lynch, M. Tuttle, An introduction to input/output automata, CWI Quarterly 2 (3) (1989) 219-246.
47. M. Mavronicolas, D. Roth, Sequential consistency and linearizability: read/write objects, Proc. 29th Annu. Allerton Conf. on Communication, Control and Computing, October 1991, pp. 683-692.
48. M. Mavronicolas, D. Roth, Efficient strongly consistent implementations of shared Memory, in: A. Segall, S. Zaks (Eds.), Proc. 6th Internat. Workshop on Distributed Algorithms (WDAG'92), Lecture Notes in Computer Science, vol. 647, Springer, Berlin, November 1992, pp. 346-361.
49. J. Misra, Axioms for memory access in asynchronous hardware systems, ACM Trans. Programming Languages Systems 8 (1) (1986) 142-153.
50. C. Papadimitriou, The serializability of concurrent database updates, J. ACM 26 (4) (1979) 631-653.
51. F. Pong, M. Dubois, The verification of cache coherence protocols, Proc. 5th Annu. ACM Symp. on Parallel Algorithms and Architectures, June/July 1993, pp. 11-20.
52. B. Simons, J. Welch, N. Lynch, An overview of clock synchronization, IBM Technical Report RJ 6505, October 1988.
53. R. Strong, D. Dolev, F. Christian, New latency bounds for atomic broadcast, Proc. 11th IEEE Real-Time Systems Symp., December 1990, pp. 156-165.
54. R.N. Zucker, J.-L. Baer, A performance study of memory consistency models, Proc. 19th ACM Internat. Symp. on Computer Architecture, May 1992, pp. 2-12.