Article

Free access

Detecting violations of sequential consistency

Authors:

Kourosh Gharachorloo,

Phillip B. GibbonsAuthors Info & Claims

SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

Pages 316 - 326

https://doi.org/10.1145/113379.113408

Published: 01 June 1991 Publication History

PDF eReader

References

[1]

Sarita Adve. Personal communication. February 1991.

Google Scholar

[2]

Sarita Adve and Mark Hill. Weak ordering - A new definition. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 2-14, May 1990.

Digital Library

Google Scholar

[3]

Sarita Adve, Mark Hill, Barton Miller, and Robert Netzer. Detecting data races on weak memory systems. in Proceedings of the 18th Annual International Symposium on Computer Architecture, May 1991.

Digital Library

Google Scholar

[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.

Google Scholar

[5]

Vasanth Balasundaram and Ken Kennedy. Compiletime detection of race conditions in a parallel program. In Proceedings of the 3rd International Conference on Supercomputing, pages 175-185, June 1989.

Digital Library

Google Scholar

[6]

A. J. Bernstein. Analysis of programs for parallel processing. IEEE Transactions on Electronic Computers, EC-15(5):757-763, October 1966.

Crossref

Google Scholar

[7]

Anne Dinning and Edith Schonberg. An empirical comparison of monitoring algorithms for access anomaly detection. In Proceedings of ACM Symposium on Principles and Practice of Parallel Programming, pages 1-10, March 1990.

Digital Library

Google Scholar

[8]

Michel Dubois and Christoph Scheurich. Memory access dependencies in shared-memory multiprocessors. IEEE Transactions on Software Engineering, 16(6):660-673, June 1990.

Digital Library

Google Scholar

[9]

Michel Dubois, Christoph Scheurich, and Fay6 Briggs. Memory access buffering in multiprocessors. In Proceedings of the 13th Annual international Symposium on Computer Architecture, pages 434---442, June 1986.

Digital Library

Google Scholar

[10]

Kourosh Gharachorloo, Anoop Gupta, and John Hennessy. Performance evaluation of memory consistency models for shared-memory multiprocessors. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 245-257, April 1991.

Digital Library

Google Scholar

[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.

Google Scholar

[12]

Kourosh Gharachorloo, Dan LenoskJ, James Laudon, Phillip Gibbons, Anoop Gupta, and John Hennessy. Memory consistency and event ordering in scalable shared-memory multiprocessors. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 15--26, May 1990.

Digital Library

Google Scholar

[13]

Phillip B. Gibbons, Michael Merritt, and Kourosh Gharachorloo. Proving sequential consistency of highperformance shared memories. In Symposium on Parallel Algorithms and Architectures, July 1991.

Digital Library

Google Scholar

[14]

James R. Goodman. Cache consistency and sequential consistency. Technical Report no. 61, SCI Committee, March 1989.

Google Scholar

[15]

Robert Hood, Ken Kennedy, and John M. MeUor- Crummey. Parallel program debugging with on-thefly anomaly detection. In Supercomputing '90, pages 74-81, November 1990.

Digital Library

Google Scholar

[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.

Google Scholar

[17]

Dan Lenoski, James Laudon, Kourosh Gharachorloo, Anoop Gupta, and John Hennessy. The directorybased cache coherence protocol for the DASH multiprocessor. In Proceedings of the 17th Annual International Symposium on Computer Architecture, pages 148-159, May 1990.

Digital Library

Google Scholar

[18]

Sang Lyul Min and Jong-Deok Choi. An efficient cache-based access anomaly detection scheme. In Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 235-244, April 1991.

Digital Library

Google Scholar

[19]

Robert Netzer and Barton Miller. Detectiaag data races in parallel program executions. Technical Report CS- 894, University of Wisconsin- Madison, November 1989.

Google Scholar

[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.

Google Scholar

[21]

Robert Netzer and Barton Miller. Improving the accuracy of data race detection, in Proceedings of ACM Symposium on Principles and Practice of Parallel Programming, pages 133-144, April 1991.

Digital Library

Google Scholar

[22]

Richard N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Acta Informatica, 19:57-84, 1983.

Digital Library

Google Scholar

[23]

Richard N. Taylor. A general-purpose algorithm for analyzing concurrent programs. Communications of the ACM, 26(5):362-376, May 1983.

Digital Library

Google Scholar

Cited By

View all

Sengupta ACao MBond MKulkarni MReddi VSmith ATang L(2017)Legato: end-to-end bounded region serializability using commodity hardware transactional memoryProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049834(1-13)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3049832.3049834
Sengupta ACao MBond MKulkarni M(2017)Legato: End-to-end bounded region serializability using commodity hardware transactional memory2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO.2017.7863724(1-13)Online publication date: Feb-2017
https://doi.org/10.1109/CGO.2017.7863724
Mitropoulou KPorpodas VJones T(2016)COMETProceedings of the International Conference on Compilers, Architectures and Synthesis for Embedded Systems10.1145/2968455.2968508(1-10)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1145/2968455.2968508
Show More Cited By

Index Terms

Recommendations

Efficient sequential consistency using conditional fences
PACT '10: Proceedings of the 19th international conference on Parallel architectures and compilation techniques

Among the various memory consistency models, the sequential consistency (SC) model, in which memory operations appear to take place in the order specified by the program, is the most intuitive and enables programmers to reason about their parallel ...
Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs
CGO '09: Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization

When a concurrent shared-memory program written with a sequential consistency (SC) model is run on a machine implemented with a relaxed consistency (RC) model, it could cause SC violations that are very hard to debug. To avoid such violations, ...
Repairing sequential consistency in C/C++11
PLDI '17

The C/C++11 memory model defines the semantics of concurrent memory accesses in C/C++, and in particular supports racy "atomic" accesses at a range of different consistency levels, from very weak consistency ("relaxed") to strong, sequential consistency ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SPAA '91: Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

June 1991

368 pages

ISBN:0897914384

DOI:10.1145/113379

Chairman:
Tom Leighton
Massachusetts Institute of Technology, Cambridge

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SPAA91

Sponsor:

SPAA91: 3rd Annual ACM Symposium on Parallel Algorithms & Architecture

July 21 - 24, 1991

South Carolina, Hilton Head, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

62
Total Citations
View Citations
610
Total Downloads

Downloads (Last 12 months)85
Downloads (Last 6 weeks)14

Reflects downloads up to 18 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sengupta ACao MBond MKulkarni MReddi VSmith ATang L(2017)Legato: end-to-end bounded region serializability using commodity hardware transactional memoryProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049834(1-13)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3049832.3049834
Sengupta ACao MBond MKulkarni M(2017)Legato: End-to-end bounded region serializability using commodity hardware transactional memory2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO)10.1109/CGO.2017.7863724(1-13)Online publication date: Feb-2017
https://doi.org/10.1109/CGO.2017.7863724
Mitropoulou KPorpodas VJones T(2016)COMETProceedings of the International Conference on Compilers, Architectures and Synthesis for Embedded Systems10.1145/2968455.2968508(1-10)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1145/2968455.2968508
Marino DSingh AMillstein TMusuvathi MNarayanasamy S(2016)DRFxACM Transactions on Programming Languages and Systems10.1145/292598838:4(1-40)Online publication date: 15-Sep-2016
https://dl.acm.org/doi/10.1145/2925988
Mitropoulou KPorpodas VZhang XJones T(2016)LynxProceedings of the 2016 International Conference on Supercomputing10.1145/2925426.2926274(1-12)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1145/2925426.2926274
Saravu P(2016)Multi-processor Memory Scoreboard: A Multi-processor Memory Ordering and Data Consistency Checker2016 17th International Workshop on Microprocessor and SOC Test and Verification (MTV)10.1109/MTV.2016.16(7-14)Online publication date: Dec-2016
https://doi.org/10.1109/MTV.2016.16
Islam MMuzahid A(2016)Detecting, Exposing, and Classifying Sequential Consistency Violations2016 IEEE 27th International Symposium on Software Reliability Engineering (ISSRE)10.1109/ISSRE.2016.48(241-252)Online publication date: Oct-2016
https://doi.org/10.1109/ISSRE.2016.48
Islam MAkram RMuzahid A(2016)Hardware-Based Sequential Consistency Violation Detection Made SimplerAlgorithms and Architectures for Parallel Processing10.1007/978-3-319-49583-5_2(18-37)Online publication date: 25-Nov-2016
https://doi.org/10.1007/978-3-319-49583-5_2
Ou PDemsky B(2015)AutoMO: automatic inference of memory order parameters for C/C++11ACM SIGPLAN Notices10.1145/2858965.281428650:10(221-240)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2858965.2814286
Ou PDemsky BAldrich JEugster P(2015)AutoMO: automatic inference of memory order parameters for C/C++11Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications10.1145/2814270.2814286(221-240)Online publication date: 23-Oct-2015
https://dl.acm.org/doi/10.1145/2814270.2814286
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient sequential consistency using conditional fences

Detecting and Eliminating Potential Violations of Sequential Consistency for Concurrent C/C++ Programs

Repairing sequential consistency in C/C++11