A correctness condition for high-performance multiprocessors

SIAM Journal on Computing

Volumn 27, Issue 6, 1998, Pages 1637-1670

  Attiya, Hagit ^a   Friedman, Roy ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Consistency conditions; Distributed shared memory; Hybrid consistency; Sequential consistency; Weak consistency

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; MULTIPROCESSING SYSTEMS; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS);

HYBRID CONSISTENCY; SEQUENTIAL CONSISTENCY; WEAK CONSISTENCY;

DATA STORAGE EQUIPMENT;

EID: 0032310106     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795289215     Document Type: Article

References (64)

1. S. ADVE AND M. HILL, Weak ordering - A new definition, in Proc. 17th ACM/IEEE International Symp. on Computer Architecture, 1990, pp. 2-14.
2. S. ADVE AND M. HILL, A Unified Formalization of Four Shared-Memory Models, Technical Report 1051, Computer Science Department, University of Wisconsin, Madison, 1991.
3. S. ADVE AND M. HILL, Sufficient Conditions for Implementing the Data-Race-Free-1 Memory Model, Technical Report 1107, Computer Science Department, University of Wisconsin, Madison, 1992.
4. 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, Atlanta, 1990.
5. M. AHAMAD, G. NEIGER, P. KOHLI, J. BURNS, AND P. HUTTO, Causal memory: Definitions, implementation, and programming, Distrib. Computing, 9 (1995), pp. 37-49.
6. G. ALVAREZ, F. CRISTIAN, AND S. MISHRA, On-Demand Asynchronous Atomic Broadcast, Technical Report CS95-416, Dept. of Computer Science, University of California, San Diego, 1995.
7. Y. AMIR, D. DOLEV, S. KRAMER, AND D. MALKI, Total Ordering of Messages in Broadcast Domains, Technical Report CS92-9, Dept. of Computer Science, The Hebrew University of Jerusalem, 1992.
8. Y. AMIR, L. E. MOSER, P. M. MELLIAR-SMITH, D.A. AGARWAL, AND P. CIARFELLA, Fast message ordering and membership using a logical token-passing ring, in Proc. 13th IEEE International Conf. on Distributed Computing Systems, 1993, pp. 551-560.
9. H. ATTIYA, S. CHAUDHURI, R. FRIEDMAN, AND J. WELCH, Shared memory consistency conditions for non-sequential execution: Definitions and programming strategies, SIAM J. Comput., 27 (1998), to appear.
10. H. ATTIYA AND R. FRIEDMAN, A Correctness Condition for High-Performance Multiprocessors. Technical Report #767, Department of Computer Science, Technion, Haifa, Israel, 1993.
11. H. ATTIYA AND R. FRIEDMAN, Programming DEC-alpha based multiprocessors the easy way, in Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1994, pp. 157-166;
12. also, Technical Report LPCR #9411, Department of Computer Science, Technion, Haifa, Israel.
13. H. ATTIYA AND J. WELCH, Sequential consistency versus linearizability, ACM Trans. Comput. Systems, 12 (1994), pp. 91-122.
14. A. BAR-NOY AND S. KIPNIS, Designing broadcasting algorithms in the postal model for message-passing systems, in Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1992, pp. 11-22.
15. J. BENNETT, J. CARTER, AND W. ZWAENEPOEL, Munin: Distributed shared memory based on type-specific memory coherence, in Proc. 2nd ACM Symp. on Principles and Practice of Parallel Processing, ACM, New York, 1990, pp. 168-176.
16. P. BERNSTEIN, V. HADZILACOS, AND H. GOODMAN, Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA, 1987.
17. K. BIRMAN, The process group approach to reliable distributed computing, Comm. ACM, 36 (1993), pp. 37-53.
18. K. BIRMAN AND T. JOSEPH, Exploiting virtual synchrony in distributed systems, in Proc. 11th ACM Symp. on Operating Systems Principles, ACM, New York, 1987, pp. 123-138.
19. K. BIRMAN AND T. JOSEPH, Reliable communication in the presence of failures, ACM Trans. Comput. Systems, 5 (1987), pp. 47-76.
20. K. BIRMAN, A. SCHIPER, AND P. STEPHENSON, Lightweight causal and atomic group multicast, ACM Trans. Comput. Systems, 9 (1991), pp. 272-314.
21. R. BISIANI, A. NOWATZYK, AND M. RAVISHANKAR, Coherent Shared Memory on a Distributed Memory Machine, in Proc. International Conf. on Parallel Processing, Pennsylvania State University, University Park, PA, 1989, pp. I-133-141.
22. W. BRANTLEY, K. MCAULIFFE, AND J. WEISS, RP3 processor-memory element, in Proc. International Conf. on Parallel Processing, Pennsylvania State University, University Park, PA, 1985, pp. 782-789.
23. L. M. CENSIER AND P. FEAUTRIER, A new solution to coherence problems in multicache systems, IEEE Trans. Comput., C-27 (1978), pp. 1112-1118.
24. J. CHANG AND N. MAXEMCHUK, Reliable broadcast protocols, ACM Trans. Comput. Systems, 2 (1984), pp. 251-273.
25. W. W. COLLIER, Architectures for Systems of Parallel Processes, Technical Report IBM TR 00.3253, IBM, Poughkeepsie, NY, 1984.
26. F. CRISTIAN, Asynchronous Atomic Broadcast, IBM Technical Disclosure Bulletin, 33, 1991, pp. 115-116;
27. also, 1st IEEE Workshop on Management of Replicated Data, Houston, TX, IEEE, Piscataway, NJ, 1990.
28. F. CRISTIAN, R. BEIJER, AND S. MISHRA, A performance comparison of asynchronous atomic broadcast protocols, Distrib. Systems Engrg. J., 1 (1994), pp. 177-201.
29. F. CRISTIAN AND S. MISHRA, The pinwheel asynchronous atomic broadcast protocols, in Proc. 2nd International Symp. on Autonomous Decentralized Systems, Phoenix, AZ, 1995;
30. also, Technical Report CSE93-331, Department of Computer Science & Engineering, University of California, San Diego.
31. D. E. CULLER, R. M. KARP, D. A. PATTERSON, A. SAHAY, K. E. SCHAUSER, E. SANTOS, R. SUBRAMONIAN, AND T. VON EIKEN, LogP: Towards a realistic model of parallel computation, in ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM, New York, 1993.
32. Also: Technical Report UCB/CS/92 713, University of California, Berkeley.
33. M. DUBOIS AND C. SCHEURICH, Memory access dependencies in shared-memory multiprocessors, IEEE Trans. Software Engrg., 16 (1990), pp. 660-673.
34. M. DUBOIS, C. SCHEURICH, AND F. A. BRIGGS, Synchronization, coherence and event ordering in multiprocessors, IEEE Trans. Comput., 21 (1988), pp. 9-21.
35. P. EZHILCHELVAN, R. MACEDO, AND S. SHRIVASTAVA, Newtop: A Fault-Tolerant Group Communication Protocol, Technical Report, Computer Science Department, University of Newcastle, Newcastle upon Tyne, UK, 1994.
36. R. FRIEDMAN, Consistency Conditions for Distributed Shared Memories. Ph.D. Thesis, Department of Computer Science, Technion, Haifa, Israel, 1994.
37. R. FRIEDMAN, Implementing hybrid consistency with high-level synchronization operations, Distrib. Comput., 9 (1995), pp. 119-129.
38. K. GHARACHORLOO, A. GUPTA, AND J. HENNESSY, Performance evaluation of memory consistency models for shared-memory multiprocessors, in Proc. 4th ACM International Conf. on Architectural Support for Programming Languages and Operating Systems, ACM, New York, 1991, pp. 245-257.
39. 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. 17th ACM/IEEE International Symp. on Computer Architecture, 1990, pp. 15-26.
40. P. GIBBONS AND E. KORACH, Testing shared memories, SIAM J. Comput., 26 (1997), pp. 1208-1244.
41. P. GIBBONS AND M. MERRITT, Specifying non-blocking shared memories, in Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1992, pp. 306-315.
42. P. GIBBONS, M. MERRITT, AND K. GHARACHORLOO, Proving sequential consistency of high-performance shared memories, in Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, ACM, New York, 1991, pp. 292-303.
43. R. J. GOODMAN, Cache Consistency and Sequential Consistency, Technical Report 1006, Computer Science Department, University of Wisconsin, Madison, 1991.
44. A. GUPTA, J. HENNESSY, K. GHARACHORLOO, T. MOWRY, AND W. WEBER, Comparative evaluation of latency reducing and tolerating techniques, in Proc. 18th ACM/IEEE International Symp. on Computer Architecture, May 1991, pp. 254-263.
45. M. HERLIHY AND J. WING, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Languages Systems, 12 (1990), pp. 463-492.
46. J. JAMES AND A. SINGH, Complete implementations for shared memory consistency conditions, in Proc. 14th ACM Symp. on Principles of Distributed Computing, ACM, New York, 1995, p. 273.
47. F. KAASHOEK, A. TANENBAUM, S. HUMMEL, AND H. BAL, An efficient reliable broadcast protocol, Operating Systems Review, 23 (1989), pp. 5-19.
48. L. LAMPORT, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. Comput., C-28 (1979), pp. 690-691.
49. K. LI AND P. HUDAK, Memory coherence in shared virtual memory systems, ACM Trans. Comput. Systems, 7 (1989), pp. 321-359.
50. R. LIPTON AND J. SANDBERG, PRAM: A Scalable Shared Memory, Technical Report CS-TR-180-88, Computer Science Department, Princeton University, Princeton, NJ, 1988.
51. K. MARZULLO, R. COOPER, M. WOOD, AND K. BIRMAN, Tools for distributed applications management, IEEE Trans. Comput., 24 (1991), pp. 42-51.
52. S. MIN AND J. BAER, A timestamp-based cache coherence scheme, in Proc. International Conf. on Parallel Processing, Pennsylvania State University, University Park, PA, 1989, pp. I-23-32.
53. C. PAPADIMITRIOU, The Theory of Concurrency Control, Computer Science Press, Rockville, MD, 1986.
54. G. L. PETERSON, Myths about the mutual exclusion problem, Inform. Process. Lett., 12 (1981), pp. 115-116.
55. U. RAMACHANDRAN, M. AHAMAD, AND M. Y. KHALIDI, Coherence of distributed shared memory: Unifying synchronization and data transfer, in Proc. International Conf. on Parallel Processing, Pennsylvania State University, University Park, PA 1989, pp. II-160-169.
56. M. RAYNAL, Algorithms for Mutual Exclusion, MIT Press, Cambridge, MA, 1986.
57. P. REYNOLDS, C. WILLIAMS, AND R. WAGNER, Empirical Analysis of Isotach Networks, Technical Report 92-19, Dept. of Computer Science, University of Virginia, Richmond, 1992.
58. C. SCHEURICH AND M. DUBOIS, Correct memory operation of cache-based multiprocessors, in Proc. 14th ACM/IEEE International Symp. on Computer Architecture, 1987, pp. 234-243.
59. A. SETUBAL AND G. GERBER, Fault-tolerant distributed database for supervisory control system, in Proc. Workshop Verteilte Datenbaksysteme, Karlsruhe University, Karlsruhe, Germany, 1991.
60. D. SHASHA AND M. SNIR, Correct and efficient execution of parallel programs that share memory, ACM Trans. Programming Languages Systems, 10 (1988), pp. 282-312.
61. A. SIEGEL, K. BIRMAN, AND K. MARZULLO, Deceit: A Flexible Distributed File System, Technical Report TR 89-1042, Department of Computer Science, Cornell University, Ithaca, NY, 1989.
62. R. VAN RENESSE, K. BIRMAN, R. FRIEDMAN, M. HAYDEN, AND D. KARR, A framework for protocol composition in horus, in Proc. 14th ACM Symposium on Principles of Distributed Computing, ACM, New York, 1995, pp. 80-89.
63. R. VAN RENESSE, K. BIRMAN, AND S. MAFFEIS, Horus: A flexible group communication system, Comm. ACM, 39 (1996), pp. 76-83.
64. R. N. ZUCKER AND J.-L. BAER, A Performance Study of Memory Consistency Models, in Proc. 19th ACM/IEEE International Symp. on Computer Architecture, 1992, pp. 2-12.