ACM Home Page
Please provide us with feedback. Feedback
Detecting violations of sequential consistency
Full text PdfPdf (1.32 MB)
Source ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the third annual ACM symposium on Parallel algorithms and architectures table of contents
Hilton Head, South Carolina, United States
Pages: 316 - 326  
Year of Publication: 1991
ISBN:0-89791-438-4
Authors
Kourosh Gharachorloo  Center for Integrated Systems, Stanford University, Stanford, CA
Phillip B. Gibbons  600 Mountain Avenue, AT&T Bell Laboratories, Murray Hill, NJ
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 28,   Citation Count: 10
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/113379.113408
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Sarita Adve. Personal communication. February 1991.
2
3
 
4
Todd R. Allen and David A. Padua. Debugging Fortran on a shared memory machine. In Proceedings of the 1987 International Conference on Parallel Processing, pages 721-727, August 1987.
5
 
6
A. J. Bernstein. Analysis of programs for parallel processing. IEEE Transactions on Electronic Computers, EC-15(5):757-763, October 1966.
7
 
8
9
10
 
11
Kourosh Gharachorloo, Anoop Gupta, and John Hennessy. Two techniques to enhance the performance of memory consistency models. In Proceedings of the 1991 International Conference on Parallel Processing, August 1991.
12
13
 
14
James R. Goodman. Cache consistency and sequential consistency. Technical Report no. 61, SCI Committee, March 1989.
 
15
 
16
Leslie Lamport. How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9):241-248, September 1979.
17
18
 
19
Robert Netzer and Barton Miller. Detectiaag data races in parallel program executions. Technical Report CS- 894, University of Wisconsin- Madison, November 1989.
 
20
Robert Netzer and Barton Miller. On the complexity of event ordering for shared-memory parallel program executions. In Proceedings of the 1990 International Conference on Parallel Processing, pages II: 93-97, August 1990.
21
 
22
Richard N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57-84, 1983.
23

CITED BY  10
 
 

Collaborative Colleagues:
Kourosh Gharachorloo: colleagues
Phillip B. Gibbons: colleagues

Peer to Peer - Readers of this Article have also read: