Fault tolerance bounds for memory consistency

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

Volumn 1320, Issue , 1997, Pages 200-214

  James, Jerry ^a   Singh, Ambuj K ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS SYSTEM; LINEARIZABILITY; MEMORY CONSISTENCY; NODE FAILURE; SEQUENTIAL CONSISTENCY; SHARED MEMORY; TOLERANCE BOUNDS; WRITE OPERATIONS;

FAULT TOLERANCE;

EID: 0141775598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030685     Document Type: Conference Paper

References (26)

1. Agrawal, D., Choy, M., Leong, H. V., and Singh, A. K. Mixed consistency: A model for parallel programming. In PODC '94 (Los Angeles, CA, USA, 1417 Aug. 1994), pp. 101-10.
2. Ahamad, M., Neiger, G., Burns, J. E., Kohli, P., and Hutto, P. W. Causal memory: Definitions, implementation and programming. Distributed Computing 9, 1 (Aug. 1995), 37-49.
3. Attiya, H. Efficient and robust sharing of memory in message-passing systems. In WD AG '96 (Bologna, Italy, 9-11 Oct. 1996), O. Babaoglu and K. Marzullo, Eds., vol. 1151 of Lecture Notes in Computer Science, Springer-Verlag, pp. 56-70.
4. Attiya, H., Bar-Noy, A., and Dolev, D. Sharing memory robustly in message-passing systems. J. ACM 42, 1 (Jan. 1995), 124-42.
5. Attiya, H., and Welch, J. L. Sequential consistency versus linearizability. ACM Trans. Comput. Syst. 12, 2 (May 1994), 91-122.
6. Borowsky, E., and Gafni, E. Generalized FLP impossibility result for t-resilient asynchronous computations (extended abstract). In STOC '93 (San Diego, CA, USA, 16-18 May 1993), pp. 91-100.
7. Chandra, T., Hadzilacos, V., Jayanti, P., and Toueg, S. Wait-freedom vs. t-resiliency and the robustness of wait-free hierarchies. In PODC '94 (Los Angeles, CA, USA, 14-17 Aug. 1994), pp. 334-43.
8. Chandra, T. D., and Toueg, S. Unreliable failure detectors for reliable distributed systems. J. ACM 43, 2 (Mar. 1996), 225-67.
9. Cristian, F. Reaching agreement on processor group membership in synchronous distributed systems. Distributed Computing 4, 4 (Apr. 1991), 175-87.
10. Dolev, D., Dwork, C, and Stockmeyer, L. On the minimal synchronism needed for distributed consensus. J. ACM 34, 1 (Jan. 1987), 77-97.
11. Friedman, R. Implementing hybrid consistency with high-level synchronization operations. Distributed Computing 9, 3 (Dec. 1995), 119-29.
12. Gharachorloo, K., Lenoski, D., Laudon, J., Gibbons, P., Gupta, A., and Hennessy, J. Memory consistency and event ordering in scalable shared-memory multiprocessors. In ISCA '90 (Seattle, WA, USA, 28-31 May 1990), pp. 15-26. Revised in Stanford CSL Technical Report 93-568.
13. Goodman, J. R. Cache consistency and sequential consistency. Tech. Rep. 1006, Computer Sciences Department, University of Wisconsin-Madison, Feb. 1991.
14. Herlihy, M. P. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1 (Jan. 1991), 124-49.
15. Herlihy, M. P., and Shavit, N. The asynchronous computability theorem for t-resilient tasks. In STOC '93 (San Diego, CA, USA, 16-18 May 1993), pp. 111-20.
16. Herlihy, M. P., and Wing, J. M. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3 (July 1990), 463-92.
17. Kosa, M. J. Making operations of concurrent data types fast. In PODC '94 (Los Angeles, CA, USA, 14-17 Aug. 1994), pp. 32-41.
18. Lamport, L. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28, 9 (Sept. 1979), 690-1.
19. Lamport, L. On interprocess communication, parts I and II. Distributed Computing 1, 2 (Apr. 1986), 77-101.
20. Lencevicius, R-, and Singh, A. K. Latency bounds for memory consistency. Submitted for publication, 1997.
21. Li, K., and Hudak, P. Memory coherence in shared virtual memory systems. ACM Trans. Comput. Syst. 7, 4 (Nov. 1989), 321-59.
22. Li, M., Tromp, J., and VitAnyi, P. M. B. How to share concurrent wait-free variables. J. ACM 43, 4 (July 1996), 723-46.
23. Lipton, R. J., and Sandberg, J. S. PRAM: A scalable shared memory. Tech. Rep. CS-TR-180-88, Department of Computer Science, Princeton University, Sept. 1988.
24. Lo, W.-K. More on ^-resilience vs. wait-freedom. In PODC '95 (Ottawa, Ontario, Canada, 20-23 Aug. 1995), pp. 110-19.
25. Malki, D., Birman, K., Ricciardi, A., and Schiper, A. Uniform actions in asynchronous distributed systems. In PODC '94 (Los Angeles, CA, USA, 1417 Aug. 1994), pp. 274-83.
26. Mavronicolas, M., and Roth, D. Efficient, strongly consistent implementations of shared memory (extended abstract). In WD AG '92 (Haifa, Israel, 2-4 Nov. 1992), A. Segall and S. Zaks. Eds., vol. 647 of Lecture Notes in Computer Science, Springer-Verlag, pp. 346-61.