One-write algorithms for multivalued regular and atomic registers

Acta Informatica

Volumn 37, Issue 3, 2000, Pages 161-192

  Chaudhuri, Soma ^a   Kosa, Martha J ^b   Welch, Jennifer L ^c  

^a Iowa State University   (United States)

^b Tennessee Technological University   (United States)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034310321     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360000040     Document Type: Article

References (7)

1. 1. S. Chaudhuri, M.J. Kosa, J.L. Welch: Upper and lower bounds for one-write multivalued regular registers. In: Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, December 1991. Also available as TR91-026 from the University of North Carolina at Chapel Hill
2. 2. S. Chaudhuri, J.L. Welch: Bounds on the costs of register implementations. SIAM J Comput, 23(2), 335-354 (1994)
3. 3. M. Herlihy, J. Wing: Linearizability: A correctness condition for concurrent objects. ACM Trans Program Lang Syst, 12(3): 463-492 (1990)
4. 4. P. Jayanti, A. Sethi, E.L. Lloyd: Minimal shared information for concurrent reading and writing. In: Proceedings of the Fifth International Workshop on Distributed Algorithms, October 1991
5. 5. L. Kirousis, E. Kranakis: A survey of concurrent readers and writers. CWI Quarterly, 2: 307-330 (1989)
6. 6. L. Lamport: On interprocess communication. Distrib Comput, 1(1): 86-101 (1986)
7. 7. N.A. Lynch, M.R. Tuttle: Hierarchical correctness proofs for distributed algorithms. In: Proceedings of the Sixth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 137-151, August 1987