On the locality of consistency conditions

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

Volumn 2848, Issue , 2003, Pages 92-105

  Vitenberg, Roman ^a   Friedman, Roy ^b  

^a University of California   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

CONSISTENCY CONDITIONS; DISJOINT SUBSETS; LINEARIZABILITY; LOCAL CONDITIONS; NONLOCALITIES; SEQUENCES OF OPERATIONS; SEQUENTIAL CONSISTENCY; SHARED OBJECTS;

C (PROGRAMMING LANGUAGE);

EID: 35248847484     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39989-6_7     Document Type: Article

References (19)

1. SPARC Architecture Manual. Version 8, Jan. 1991.
2. M. Ahamad, R. Bazzi, R. John, P. Kohli, and G. Neiger. The Power of Processor Consistency. In 5th ACM Symposium On Parallel Algorithms and Architectures, pages 251-260, June 1993.
3. M. Ahamad, P. Hutto, and R. John. Implementing and Programming Causal Distributed Shared Memory. Technical Report TR GIT-CC-90-49, Georgia Institute of Technology, Dec. 1990.
4. M. Ahamad, G. Neiger, P. Kohli, J. Burns, and P. Hutto. Causal Memory: Definitions, Implementation, and Programming. Distributed Computing, 9(1), 1993.
5. H. Attiya and R. Friedman. Limitations of Fast Consistency Conditions for Distributed Shared Memories. Information Processing Letters, 57(5):243-248, 1995.
6. H. Attiya and R. Friedman. A Correctness Condition for High-Performance Multiprocessors. SIAM Journal of Computing, 27(2), Apr. 1998.
7. H. Attiya and J. Welch. Sequential Consistency versus Linearizability. ACM Transactions on Computer Systems, 12(2):91-122, May 1994.
8. B. N. Bershad, M. J. Zekauskas, and W. A. Sawdon. The Midway Distributed Shared Memory System. In Proc. of the 38th IEEE Intl. Computer Conf. (COMPCON), pages 528-537, Feb. 1993.
9. B. Charron-Bost and R. Cori. A Note on Linearizability and the Global Time Axiom. Parallel Processing Letters, 13(1):19-24, Mar. 2003.
10. A. Fernández, E. Jiménez, and V. Cholvi. On the Interconnection of Causal Memory Systems. In Proc. of the 19th ACM Symposium on Principles of Distributed Computing, Apr. 2000.
11. R. Friedman. Consistency Conditions for Distributed Shared Memories. PhD thesis, Department of Computer Science, The Technion, 1994.
12. V. K. Garg and M. Raynal. Normality: A Consistency Condition for Concurrent Objects. Parallel Processing Letters, 9(1):123-134, 1999.
13. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory Consistency and Event Ordering in Scalable Shared-Memory Multiprocessors. In Proc. of the 17th International Symposium on Computer Architecture, pages 15-26, May 1990.
14. M. Herlihy and J. Wing. Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. on Programming Languages and Systems, 12(3):463-492, 1990.
15. J. Kawash. Limitations and Capabilities of Weak Memory Consistency Systems. PhD thesis, Computer Science Dept., University of Calgary, 2000.
16. L. Lamport. How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs. IEEE Trans. on Computers, C-28(9):690-691, 1979.
17. R. Lipton and J. Sandberg. PRAM: A Scalable Shared Memory. Technical Report CS-TR-180-88, Computer Science Department, Princeton University, Sept. 1988.
18. V. Luchangco. Memory Consistency Models for High Performance Distributed Computing. PhD thesis, MIT Department of Electrical Engineering and Computer Science, 2001.
19. C. Papadimitriou. The Theory of Concurrency Control. Computer Science Press, 1986.