Memory consistency models for high-performance distributed computing

Thesis (Sc. D.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2001.

[1]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[2]  Christopher F. Joerg,et al.  The Cilk system for parallel multithreaded computing , 1996 .

[3]  Leslie Lamport,et al.  Pretending Atomicity , 1989 .

[4]  Matteo Frigo,et al.  DAG-consistent distributed shared memory , 1996, Proceedings of International Conference on Parallel Processing.

[5]  Xiaowei Shen,et al.  Improving the Java memory model using CRF , 2000, OOPSLA '00.

[6]  Michel Dubois,et al.  Memory access buffering in multiprocessors , 1998, ISCA '98.

[7]  John M. Mellor-Crummey,et al.  On-the-fly detection of data races for programs with nested fork-join parallelism , 1991, Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91).

[8]  Roy Friedman,et al.  Shared memory consistency conditions for non-sequential execution: definitions and programming strategies , 1993, SPAA '93.

[9]  Rida A. Bazzi,et al.  The power of processor consistency , 1993, SPAA '93.

[10]  Assaf Schuster,et al.  Java consistency: nonoperational characterizations for Java memory behavior , 2000, TOCS.

[11]  Michel Dubois,et al.  Synchronization, coherence, and event ordering in multiprocessors , 1988, Computer.

[12]  Edsger W. Dijkstra,et al.  Cooperating sequential processes , 2002 .

[13]  Peter J. Keleher,et al.  The relative importance of concurrent writers and weak consistency models , 1996, Proceedings of 16th International Conference on Distributed Computing Systems.

[14]  David B. Lomet,et al.  Process structuring, synchronization, and recovery using atomic actions , 1977, Language Design for Reliable Software.

[15]  Brian N. Bershad,et al.  The Midway distributed shared memory system , 1993, Digest of Papers. Compcon Spring.

[16]  Matteo Frigo,et al.  The weakest reasonable memory model , 1998 .

[17]  C. A. R. Hoare,et al.  Monitors: an operating system structuring concept , 1974, CACM.

[18]  Jalal Y. Kawash.  Limitations and capabilities of weak memory consistency systems , 2000 .

[19]  Mordechai Ben-Ari,et al.  Principles of concurrent programming , 1982 .

[20]  Larry Rudolph,et al.  Commit-reconcile & fences (CRF): a new memory model for architects and compiler writers , 1999, ISCA.

[21]  Mark D. Hill,et al.  A Unified Formalization of Four Shared-Memory Models , 1993, IEEE Trans. Parallel Distributed Syst..

[22]  Edith Schonberg,et al.  Detecting access anomalies in programs with critical sections , 1991, PADD '91.

[23]  Sarita V. Adve,et al.  Designing memory consistency models for shared-memory multiprocessors , 1993 .

[24]  Thomas Bräunl.  Parallel programming - an introduction , 1993 .

[25]  Mark D. Hill,et al.  Weak ordering—a new definition , 1998, ISCA '98.

[26]  Roy Friedman,et al.  A Correctness Condition for High-Performance Multiprocessors , 1998, SIAM J. Comput..

[27]  Donald Yeung,et al.  The MIT Alewife machine: architecture and performance , 1995, ISCA '98.

[28]  Jack B. Dennis,et al.  Programming semantics for multiprogrammed computations , 1966, CACM.

[29]  Dennis Shasha,et al.  Efficient and correct execution of parallel programs that share memory , 1988, TOPL.

[30]  Liviu Iftode,et al.  Scope consistency: a bridge between release consistency and entry consistency , 1996, SPAA '96.

[31]  Mark D. Hill,et al.  Implementing Sequential Consistency in Cache-Based Systems , 1990, ICPP.

[32]  Jalal Kawash,et al.  WEAK MEMORY CONSISTENCY MODELS PART ONE: DEFINITIONS AND COMPARISONS , 1998 .

[33]  David L Weaver,et al.  The SPARC architecture manual : version 9 , 1994 .

[34]  Sarita V. Adve,et al.  Shared Memory Consistency Models: A Tutorial , 1996, Computer.

[35]  Jayadev Misra.  Axioms for memory access in asynchronous hardware systems , 1986, TOPL.

[36]  Shreekant S. Thakkar,et al.  The Symmetry Multiprocessor System , 1988, ICPP.

[37]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[38]  Roger M. Needham,et al.  Grapevine: an exercise in distributed computing , 1982, CACM.

[39]  Xiaowei Shen,et al.  Design and verification of adaptive cache coherence protocols , 2000 .

[40]  Philip J. Woest,et al.  The Wisconsin multicube: a new large-scale cache-coherent multiprocessor , 1988, ISCA '88.

[41]  Barton P. Miller,et al.  What are race conditions?: Some issues and formalizations , 1992, LOPL.

[42]  K. Gharachodoo,et al.  Memory consistency models for shared memory multiprocessors , 1996 .

[43]  William Pugh,et al.  Semantics of Multithreaded Java , 2001 .

[44]  Bradley C. Kuszmaul,et al.  Cilk: an efficient multithreaded runtime system , 1995, PPOPP '95.

[45]  Victor Luchangco,et al.  Computation-centric memory models , 1998, SPAA '98.

[46]  Barton P. Miller,et al.  Improving the accuracy of data race detection , 1991, PPOPP '91.

[47]  Liviu Iftode,et al.  Scope Consistency: A Bridge between Release Consistency and Entry Consistency , 1996, SPAA '96.

[48]  Robert H. B. Netzer,et al.  Efficient Race Condition Detection for Shared-Memory Programs with Post/Wait Synchronization , 1992, International Conference on Parallel Processing.

[49]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[50]  Per Brinch Hansen,et al.  Structured multiprogramming , 1972, CACM.

[51]  Daniel E. Lenoski,et al.  Scalable Shared-Memory Multiprocessing , 1995 .

[52]  Anoop Gupta,et al.  Parallel computer architecture - a hardware / software approach , 1998 .

[53]  Guy L. Steele,et al.  The Java Language Specification , 1996 .

[54]  Leslie Lamport,et al.  How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs , 2016, IEEE Transactions on Computers.

[55]  Donald Yeung,et al.  Low-Cost Support for Fine-Grain Synchronization in Multiprocessors , 1992, Multithreaded Computer Architecture.

[56]  James R. Goodman,et al.  Cache Consistency and Sequential Consistency , 1991 .

[57]  David E. Culler,et al.  Monsoon: an explicit token-store architecture , 1998, ISCA '98.

[58]  Allan Porterfield,et al.  The Tera computer system , 1990, ICS '90.

[59]  Anoop Gupta,et al.  Memory consistency and event ordering in scalable shared-memory multiprocessors , 1990, ISCA '90.

[60]  Guillaume Pierre,et al.  Replicated directory service for weakly consistent distributed caches , 1999, Proceedings. 19th IEEE International Conference on Distributed Computing Systems (Cat. No.99CB37003).

[61]  Mark D. Hill,et al.  Multiprocessors Should Support Simple Memory-Consistency Models , 1998, Computer.

[62]  David Mosberger,et al.  Memory consistency models , 1993, OPSR.

[63]  Anoop Gupta,et al.  The Stanford Dash multiprocessor , 1992, Computer.

[64]  Anoop Gupta,et al.  Performance evaluation of memory consistency models for shared-memory multiprocessors , 1991, ASPLOS IV.

[65]  Randal E. Bryant,et al.  Concurrent programming , 1980, Operating Systems Engineering.

[66]  Burton J. Smith,et al.  The architecture of HEP , 1985 .

[67]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[68]  Charles E. Leiserson,et al.  Efficient Detection of Determinacy Races in Cilk Programs , 1997, SPAA '97.

[69]  G. Cheng,et al.  Algorithms for Data-Race Detection in Multithreaded Programs , 1998 .

[70]  Cathy May,et al.  The PowerPC Architecture: A Specification for a New Family of RISC Processors , 1994 .

[71]  Charles E. Leiserson,et al.  Detecting data races in Cilk programs that use locks , 1998, SPAA '98.

[72]  Andrew D. Birrell,et al.  An Introduction to Programming with Threads , 1996 .

[73]  Alan L. Cox,et al.  TreadMarks: Distributed Shared Memory on Standard Workstations and Operating Systems , 1994, USENIX Winter.

[74]  Mahadev Satyanarayanan,et al.  Coda: A Highly Available File System for a Distributed Workstation Environment , 1990, IEEE Trans. Computers.

[75]  William Pugh.  Fixing the Java memory model , 1999, JAVA '99.

[76]  Irving L. Traiger,et al.  Granularity of Locks and Degrees of Consistency in a Shared Data Base , 1998, IFIP Working Conference on Modelling in Data Base Management Systems.

[77]  Marvin Theimer,et al.  Session guarantees for weakly consistent replicated data , 1994, Proceedings of 3rd International Conference on Parallel and Distributed Information Systems.

[78]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[79]  Liuba Shrira,et al.  Lazy replication: exploiting the semantics of distributed services (extended abstract) , 1990, OPSR.

[80]  Willy Zwaenepoel,et al.  Implementation and performance of Munin , 1991, SOSP '91.

[81]  Richard J. Lipton,et al.  Reduction: a method of proving properties of parallel programs , 1975, CACM.

[82]  Victor Luchangco.  Modeling weakly consistent memories with locks , 2001, SPAA '01.

[83]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[84]  Jalal Kawash,et al.  DEFINING AND COMPARING MEMORY CONSISTENCY MODELS , 1997 .

[85]  Roy Friedman,et al.  Limitations of Fast Consistency Conditions for Distributed Shared Memories , 1996, Inf. Process. Lett..

[86]  Jean-Loup Baer,et al.  A performance study of memory consistency models , 1992, ISCA '92.

[87]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[88]  Michel Dubois,et al.  Memory Access Dependencies in Shared-Memory Multiprocessors , 1990, IEEE Trans. Software Eng..

[89]  Kourosh Gharachorloo,et al.  Proving sequential consistency of high-performance shared memories (extended abstract) , 1991, SPAA '91.

[90]  Victor Luchangco,et al.  Precedence-Based Memory Models , 1997, WDAG.

[91]  Barton P. Miller,et al.  Detecting Data Races on Weak Memory Systems , 1991, ISCA.