A Unified Formalization of Four Shared-Memory Models

IEEE Transactions on Parallel and Distributed Systems

Volumn 4, Issue 6, 1993, Pages 613-624

  Adve, Sarita V ^a   Hill, Mark D ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

Data race free 0; data race free 1; memory model; release consistency; sequential consistency; shared memory multiprocessor; weak ordering

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; DATA HANDLING; HAZARDS AND RACE CONDITIONS; MATHEMATICAL MODELS; OPTIMIZATION; RANDOM ACCESS STORAGE; SYNCHRONIZATION;

DATA RACE FREE 0; DATA RACE FREE 1; RELEASE CONSISTENCY; SEQUENTIAL CONSISTENCY; WEAK ORDERING;

MULTIPROCESSING SYSTEMS;

EID: 0027608117     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.242161     Document Type: Article

References (28)

1. S. V. Adve and M. D. Hill, “Weak ordering—A new definition,” in Proc. 17th Annu. Int. Symp. Comput. Architecture, May 1990, pp. 2–14.
2. S. V. Adve, M. D Hill, B. P. Miller, and R. H. B. Netzer, “Detecting data races on weak memory systems,” in Proc. 18th Annu. Int. Symp. Comput. Architecture, May 1991, pp. 234–243.
3. S. V. Adve and M. D. Hill, “Sufficient conditions for implementing the data-race-free-1 memory model,” Comput. Sci. Tech. Rep. #1107, Univ. Wisconsin, Madison, Sept. 1992.
4. A. Agarwal, R. Simoni, M. Horowitz, and J. Hennessy, “An evaluation of directory schemes for cache coherence,” in Proc. 15th Annu. Int. Symp. Comput. Architecture, Honolulu, HI, June 1988, pp. 280–289.
5. M. Ahamad, P. W. Hutto, and R. Hohn, “Implementing and programming causal distributed shared memory,” College of Computing Tech. Rep. GIT-CC-90-49, Georgia Institute of Technology, Nov. 1990.
6. J. Archibald and J. Baer, “Cache coherence protocols: Evaluation using a multiprocessor simulation model,” ACM Trans. Comput. Syst., vol. 4, no. 4, pp. 273–298, Nov. 1986.
7. R. DeLeone and O. L. Mangasarian, “Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem,” Mathematical Programming, vol. 42, pp. 347–361, 1988.
8. VAX Architecture Handbook, 1981.
9. M. Dubois, C. Scheurich, and F. A. Briggs, “Memory access buffering in multiprocessors,” in Proc. 13th Annu. Int. Symp. Comput. Architecture, vol. 14, no. 2, June 1986, pp. 434–442.
10. M. Dubois and C. Scheurich, “Memory access dependencies in shared-memory multiprocessors,” IEEE Trans. Software Eng., vol. SE-16, no. 6, 660–673, June 1990.
11. 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 Annu. Int. Symp. Comput. Architecture, May 1990, pp. 15–26.
12. K. Gharachorlooo, A. Gupta, and J. Hennessy, “Two techniques to enhance the performance of memory consistency models,” in Proc. Int. Conf. Parallel Processing, 1991, pp. 1355–1364.
13. K. Gharachorlooo, A. Gupta, and J. Hennessy, “Performance evaluation of memory consistency models for shared-memory multiprocessors,” in Proc. 4th Int. Conf. Architectural Support for Programming Languages and Oper. Syst., 1991, pp. 245–257.
14. K. Gharachorloo and P. B. Gibbons, “Detecting violations of sequential consistency,” in Proc. Symp. Parallel Algorithms and Architectures, July 1991, pp. 316–326.
15. P. B. Gibbons, M. Meritt, and K. Gharachorloo, “Proving sequential consistency of high-performance shared memories,” in Proc. Parallel Algorithms and Architectures, July 1991, pp. 292–303.
16. J. R. Goodman, “Cache consistency and sequential consistency,” Com-put. Sci. Tech. Rep. #1006, Univ. Wisconsin, Madison, Feb. 1991.
17. A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir, “The NYU Ultaracomputer—Designing an MIMD shared memory parallel computer,” IEEE Trans. Comput., pp. 175–189, Feb. 1983.
18. P. W. Hutto and M. Ahamad, “Slow memory: Weakening consistency to enhance concurrency in distributed shared memories,” in Proc. 10th Int. Conf. Distributed Comput. Syst., 1990, pp. 302–311.
19. IBM System/370 Principles of Operation, Publication Number GA22-7000-9, File Number S370-01, May 1983.
20. D. Kroft, “Lockup-free instruction fetch/prefetch cache organization,” in Proc. Symp. Architecture, May 1981, 81–87.
21. L. Lamport, “How to make a multiprocessor computer that correctly executes multiprocess programs,” IEEE Trans. Comput., vol. C-28, no. 9, pp. 690–691, Sept. 1979.
22. R. J. Lipton and J. S. Sandberg, “PRAM: A scalable shared memory,” Tech. Rep. CS-Tech. Rep.-180-88, Princeton Univ., Sept. 1988.
23. J. M. Mellor-Crummey and M. L. Scott, “Algorithms for scalable synchronization on shared-memory multiprocessors,” ACM Trans. Comput. Syst., pp. 21–65, Feb. 1991.
24. J. Patel, “Multiprocessor cache memories,” Seminar at Texas Instruments Research Labs. (Dallas, TX, Dec. 1983), Intel (Aloha, OR, Apr. 1984), Digital Equipment (Hudson, MA, June 1984), IBM (Yorktown, Oct. 1984), IBM (Poughkeepsie, Aug. 1986).
25. The SPARC Architecture Manual, Sun Microsystems Inc., No. 800-199-12, Version 8, Jan. 1991.
26. C. E. Scheurich, “Access ordering and coherence in shared memory multiprocessors,” Ph.D. dissertation, Dep. Comput. Eng., Tech. Rep. CENG 89–19, Univ. Southern California, May 1989.
27. D. Shasha and M. Snir, “Efficient and correct execution of parallel programs that share memory,” ACM Trans. Programming Languages and Syst., vol. 10, no. 2, pp. 282–312, Apr. 1988.
28. R. N. Zucker, “A study of weak consistency models,” dissertation proposal, Univ. Washington, 1991.