Multi-writer consistency conditions for shared memory objects

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

Volumn 2848, Issue , 2003, Pages 106-120

  Shao, Cheng ^a   Pierce, Evelyn ^a   Welch, Jennifer L ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS;

CONSISTENCY CONDITIONS; MULTIPLE WRITERS; MUTUAL EXCLUSIONS; PARTIAL ORDER; QUORUM-BASED ALGORITHMS; RELATIVE STRENGTH; SHARED VARIABLES; WRITER CONSISTENCY;

MEMORY ARCHITECTURE;

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

References (19)

1. M. Ahamad, R. Bazzi, R. John, P. Kohli, and G. Neiger. The Power of Processor Consistency. ACM Symposium on Parallel Algorithms and Architectures, pp.251-260, 1993.
2. H. Attiya, A. Bar-Noy, and D. Dolev. Sharing Memory Robustly in Message Passing Systems. Journal of the ACM, Vol.42, No.1, pp.124-142, 1996.
3. H. Attiya and R. Friedman. A Correctness Condition for High Performance Multiprocessors. Proceedings of the 24th ACM Symposium on Theory of Computing, pp.679-690, 1992.
4. H. Attiya and J. Welch. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw Hill, 1998.
5. R. A. Bazzi. Synchronous Byzantine Quorum Systems. Distributed Computing, Vol 13, No.1, pp.45-52, 2000.
6. T. D. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, Vol.43, No.2, pp.225-267, 1996.
7. J. Goodman. Cache Consistency and Sequential Consistency. Technical Report 61, IEEE Scalable Coherent Interface Working Group, 1989.
8. M. Herlihy and J. Wing. Linearizability: A Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems, Vol.12, No.3, pp.463-492, 1990.
9. L. Higham and J. Kawash. Bounds for Mutual Exclusion with Only Processor Consistency. Proceedings of the 14th International Symposium on Distributed Computing, pp. 44-58, 2000.
10. L. Lamport. How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs. IEEE Transactions on Computers, Vol. C-28, No.9, pp. 690-691, Sept. 1979.
11. L. Lamport. On Interprocessor Communication. Part I and II. Distributed Computing, Vol.1, No.2, pp. 77-101, 1986.
12. R. Lipton and J. Sandberg. PRAM: A Scalable Shared Memory. Technical Report 180-88, Department of Computer Science, Princeton University, 1988.
13. N. Lynch and A. Shvartsman. RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. Proceedings of the 16th International Symposium on Distributed Computing, 2002.
14. H. Lee and J. Welch. Applications of Probabilistic Quorums to Iterative Algorithms. Proceedings of the 21st International Conference on Distributed Computing Systems, pp.21-30, 2001.
15. D. Malkhi and M. Reiter. Byzantine Quorum Systems. Distributed Computing, Vol.11, No.4, pp.203-213, 1998.
16. D. Malkhi, M. Reiter, A. Wool, and R. Wright. Probabilistic Quorum Systems. Information and Computation, Vol.170, No.2, pp.184-206, 2001.
17. G. L. Peterson. Myths about the Mutual Exclusion Problem. Information Processing Letters, Vol.12, No.3, pp. 115-116, June 1981.
18. M. Raynal. Algorithms for Mutual Exclusion. The MIT Press, 1986.
19. C. Shao, E. Pierce, and J. Welch. Multi-Writer Consistency Conditions for Shared Memory Objects. Technical Report 2003-7-1, Department of Computer Science, Texas A&M University, July 2003.