Testing shared memories

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1208-1244

  Gibbons, Phillip B ^a   Korach, Ephraim ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Linearizability; Multiprocessors; NP completeness; Shared memory; Squential consistency; Testing

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; FAULT TOLERANT COMPUTER SYSTEMS; LINEARIZATION; PARALLEL PROCESSING SYSTEMS;

MULTIPROCESSOR MEMORY SYSTEM; SEQUENTIAL CONSISTENCY; SHARED MEMORY;

MULTIPROCESSING SYSTEMS;

EID: 0031211417     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794279614     Document Type: Article

References (34)

1. S. V. ADVE, Designing memory consistency models for shared-memory multiprocessors, Ph.D. thesis, University of Wisconsin, Madison, WI, 1993.
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 International Symposium on Computer Architecture, ACM, New York, 1991, pp. 234-243.
3. Y. AFEK, G. M. BROWN, AND M. MERRITT, Lazy caching, ACM Trans. Programming Lang. Systems, 15 (1993), pp. 182-205.
4. Y. AFEK, D. S. GREENBERG, M. MERRITT, AND G. TAUBENFELD, Computing with faulty shared objects, J. Assoc. Comput. Mach., 42 (1995), pp. 1231-1274.
5. A. AGARWAL, D. CHAIKEN, G. D'SOUZA, K. JOHNSON, D. KRANZ, J. KUBIATOWICZ, K. KURIHARA, B.-H. LIM, G. MAA, D. NUSSBAUM, M. PARKIN, AND D. YEUNG, The MIT Alewife machine: A large-scale distributed-memory multiprocessor, in Proc. Workshop on Scalable Shared Memory Multiprocessors, Kluwer Academic Publishers, Norwell, MA, 1991.
6. D. AGRAWAL, J. L. BRUNO, A. EL ABBADI, AND V. KRISHNASWAMY, Relative serializability: An approach for relaxing the atomicity of transactions, in Proc. 13th ACM Symposium on Principles of Database Systems, ACM, New York, 1994, pp. 139-149.
7. R. ALVERSON, D. CALLAHAN, D. CUMMINGS, B. KOBLENZ, A. PORTERFIELD, AND B. SMITH, The Tera computer system, in Proc. 1990 International Conference on Supercomputing, ACM, New York, 1990, pp. 1-6.
8. H. ATTIYA AND J. L. WELCH, Sequential consistency versus linearizability, ACM Trans. Comput. Systems, 12 (1994), pp. 91-122.
9. M. BLUM, W. EVANS, P. GEMMELL, S. KANNAN, AND M. NAOR, Checking the correctness of memories, Algorithmica, 12 (1994), pp. 225-244.
10. J. BRIGHT AND G. SULLIVAN, Checking mergeable priority queues, in Proc. 24th IEEE Fault-Tolerant Computing Symposium, IEEE, Piscataway, NJ, 1994, pp. 144-153.
11. W. W. COLLIER, Reasoning About Parallel Architectures, Prentice-Hall, Englewood Cliffs, NJ, 1992.
12. S. FRANK, H. BURKHARDT III, AND J. ROTHNIE, The KSR1: Bridging the gap between shared memory and MPPs, in Proc. 1993 IEEE Compcon Spring, IEEE, Piscataway, NJ, 1993, pp. 285-294.
13. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, New York, 1979.
14. K. GHARACHORLOO AND P. B. GIBBONS, Detecting violations of sequential consistency, in Proc. 3rd ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1991, pp. 316-326.
15. K. GHARACHORLOO, A. GUPTA, AND J. HENNESSY, Two techniques to enhance the performance of memory consistency models, in Proc. 1991 International Conference on Parallel Processing, CRC Press, Boston, MA, 1991, pp. I:355-364.
16. 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 International Symposium on Computer Architecture, IEEE, Piscataway, NJ, 1990, pp. 15-26.
17. P. B. GIBBONS AND E. KORACH, Testing for sequential consistency, in preparation.
18. P. B. GIBBONS AND E. KORACH, The complexity of sequential consistency, in Proc. 4th IEEE Symposium on Parallel and Distributed Processing, IEEE, Piscataway, NJ, 1992, pp. 317-325.
19. P. B. GIBBONS AND E. KORACH, On testing cache-coherent shared memories, in Proc. 6th ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1994, pp. 177-188.
20. P. B. GIBBONS AND M. MERRITT, Specifying nonblocking shared memories, in Proc. 4th ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1992, pp. 306-315.
21. P. B. GIBBONS, M. MERRITT, AND K. GHARACHORLOO, Proving sequential consistency of high-performance shared memories, in Proc. 3rd ACM Symposium on Parallel Algorithms and Architectures, ACM, New York, 1991, pp. 292-303.
22. M. P. HERLIHY AND J. M. WING, Linearizability: A correctness condition for concurrent objects, ACM Trans. Programming Lang. Systems, 12 (1990), pp. 463-492.
23. R. HOOD, K. KENNEDY, AND J. MELLOR-CRUMMEY, Parallel program debugging with on-the-fly anomaly detection, in Proc. 1990 International Conference on Supercomputing, ACM, New York, 1990, pp. 74-81.
24. E. H. JENSEN, G. W. HAGENSEN, AND J. M. BROUGHTON, A new approach to exclusive data access in shared memory multiprocessors, Technical Report UCRL-97663, Lawrence Livermore National Laboratory, Livermore, CA, 1987.
25. V. KRISHNASWAMY AND J. BRUNO, On the complexity of concurrency control using semantic information, Technical Report TRCS 92-21, Department of Computer Science, University of California at Santa Barbara, Santa Barbara, CA, 1992.
26. L. LAMPORT, How to make a multiprocessor computer that correctly executes multiprocess programs, IEEE Trans. Comput., C-28 (1979), pp. 690-691.
27. D. LENOSKI, J. LAUDON, K. GHARACHORLOO, W.-D. WEBER, A. GUPTA, J. HENNESSY, M. HOROWITZ, AND M. S. LAM, The Stanford DASH multiprocessor, IEEE Comput., 25 (1992), pp. 63-79.
28. J. MELLOR-CRUMMEY, Compile-time support for efficient data race detection in shared-memory parallel programs, in Proc. 3rd ACM/ONR Workshop on Parallel and Distributed Debugging, ACM, New York, 1993, pp. 129-139.
29. R. H. B. NETZER AND B. P. MILLER, Improving the accuracy of data race detection, in Proc. 3rd ACM Symposium on Principles and Practice of Parallel Programming, ACM, New York, 1991, pp. 133-144.
30. C. PAPADIMITRIOU, The serializability of concurrent database updates, J. Assoc. Comput. Mach., 26 (1979), pp. 631-653.
31. C. PAPADIMITRIOU, The Theory of Database Concurrency Control, Computer Science Press, Rockville, MD, 1986.
32. F. PONG AND M. DUBOIS, A new approach for the verification of cache coherence protocols, IEEE Trans. Parallel Distrib. Systems, 6 (1995), pp. 773-787.
33. D. SHASHA AND M. SNIR, Efficient and correct execution of parallel programs that share memory, ACM Trans. Programming Lang. Systems, 10 (1988), pp. 282-312.
34. J. M. WING AND C. GONG, Testing and verifying concurrent objects, J. Parallel Distrib. Comput., 17 (1993), pp. 164-182.