Article

Free access

On-the-fly detection of data races for programs with nested fork-join parallelism

Author:

John Mellor-CrummeyAuthors Info & Claims

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Pages 24 - 33

https://doi.org/10.1145/125826.125861

Published: 01 August 1991 Publication History

PDF eReader

References

[1]

R. Alien, D. Baumgartner, K. Kennedy, and A. Porterfield. PTOOL: A semi-automatic parallel programming assistant. In Proc. of the 1986 International Conference on Parallel Processing, pages 164- 170, Aug. 1986.

Google Scholar

[2]

T. R. Allen and D. A. Padua. Debugging fortran on a shared memory machine. In Proc. of the 1987 International Conference on Parallel Processing, pages 721-727, Aug. 1987.

Google Scholar

[3]

W. F. Appelbe and C. E. McDowell. Anomaly reporting - a tool for debugging and developing parallel numerical applications. In Proc. First international Conference on Supercomputers, FL, Dec. 1985.

Google Scholar

[4]

V. Balasundaram, K. Kennedy, U. Kremer, K. McKinley, and J. Sublok. The ParaScope editor" An interactive parallel programming tool. In Proc. Supercomputing '89, pages 540-550, Reno, NV, Nov. 1989.

Digital Library

Google Scholar

[5]

J.-D. Choi, B. P. Miller, and R. H. B. Netzer. Techniques for debugging parallel programs with flowback analysis. A CM Transactions on Programming Languages and Systems, 1991.

Digital Library

Google Scholar

[6]

A. Dinning and E. Schonberg. An evaluation of monitoring algorithms for access anomaly detection. U1- tracomputer Note 163, Courant Institute, New York University, July 1989.

Google Scholar

[7]

A. Dinning and E. Schonberg. An empirical comparison of monitoring algorithms for access anomaly detection. In Second A CM SIGPLAN Symposium on Principles 8J Practice of Parallel Programming (PPOPP), pages 1-10, Mar. 1990.

Digital Library

Google Scholar

[8]

L. Lamport. How to make a multiprocessor that correctly executes multiprocess programs. IEEE Transactions on Computers, C-28(9), Sept. 1979.

Google Scholar

[9]

S. L. Min and :I.-D. Choi. An efficient cache-based access anomaly detection scheme, in Proc. of the $th International Conference on Architectural Support for Programming Languages and Operating Systems, pages 235-244, Palo Alto, CA, Apr. 1991.

Digital Library

Google Scholar

[10]

R. H. B. Netzer and B. P. Miller. Detecting data races in parallel program executions. In D. Gelernter, T. Gross, A. Nicolau, and D. Padua, editors, Languages and Compilers for Parallel Computing. MIT Press, 1991. Also in Proc. of the 3rd Workshop on Prog. Langs. and Compilers for Parallel Computing, Irvine, CA, (Aug. 1990).

Google Scholar

[11]

I. Nudler and L. Rudolph. Tools for efficient development of efficient parallel programs, in First Israeli Conference on Computer Systems Engineering, 1988. Cited in {7}.

Google Scholar

[12]

E. Schonberg. On-the-fly detection of access anomalies. In Proc. A CM SIGPLAN '89 Conference on Programming Language Design and Implementation, pages 285-297, June 1989.

Digital Library

Google Scholar

[13]

G. L. Steele, Jr. Making asynchronous parallelism safe for the world. In Proc. o.f the 1990 Symposium on the Principles of Programming Languages, pages 218-231, Jan. 1990.

Digital Library

Google Scholar

[14]

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

Digital Library

Google Scholar

[15]

M. Young and R. N. Taylor. Combining static concurrency analysis with symbolic execution. IEEE Transactions on Software Engineering, 14(10):1499-1511, Oct. 1988.

Digital Library

Google Scholar

Cited By

View all

Jin FTao AYu LSarkar V(2024)Visualizing Correctness Issues in OpenMP ProgramsAdvancing OpenMP for Future Accelerators10.1007/978-3-031-72567-8_11(161-175)Online publication date: 16-Sep-2024
https://doi.org/10.1007/978-3-031-72567-8_11
Wilkins MWestrick SKandiah VBernat ASuchy BDeiana ECampanoni SAcar UDinda PHardavellas NDubach CBruening DHardekopf B(2023)WARDen: Specializing Cache Coherence for High-Level Parallel LanguagesProceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3579990.3580013(122-135)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3579990.3580013
Lepers BGiet JZwaenepoel WLawall JFedorova ANarayanan DDi Luna GQuerzoni L(2023)OFence: Pairing Barriers to Find Concurrency Bugs in the Linux KernelProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3567504(33-45)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3552326.3567504
Show More Cited By

Index Terms

On-the-fly detection of data races for programs with nested fork-join parallelism

Recommendations

Dynamic instrumentation for nested fork-join parallelism in OpenMP programs
FGIT'12: Proceedings of the 4th international conference on Future Generation Information Technology

It is important to determine the logical concurrency of OpenMP programs, because it helps detecting data races between two threads in an execution of the program. RaceStand have been developed to detect on-the-fly data races for OpenMP applications. ...
On-the-fly detection of data races in OpenMP programs
PADTAD 2012: Proceedings of the 2012 Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging

OpenMP provides a portable way to achieve high performance and simple compiler directives to transform a sequential program into parallel program. It is important to detect data races in OpenMP programs, because they may lead to unpredictable results ...
Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs
SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

If a parallel program has determinacy race(s), different schedules can result in memory accesses that observe different values --- various race-detection tools have been designed to find such bugs. A key component of race detectors is an algorithm for ...

Comments

Information & Contributors

Information

Published In

Supercomputing '91: Proceedings of the 1991 ACM/IEEE conference on Supercomputing

August 1991

920 pages

ISBN:0897914597

DOI:10.1145/125826

Conference Chair:
Ray Elliott

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 August 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SC '91

Sponsor:

SIGARCH
IEEE-CS

SC '91: International Conference for High Performance Computing, Networking, Storage and Analysis

November 18 - 22, 1991

New Mexico, Albuquerque, USA

Acceptance Rates

Supercomputing '91 Paper Acceptance Rate 83 of 215 submissions, 39%;

Overall Acceptance Rate 1,516 of 6,373 submissions, 24%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

200
Total Citations
View Citations
721
Total Downloads

Downloads (Last 12 months)72
Downloads (Last 6 weeks)16

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Jin FTao AYu LSarkar V(2024)Visualizing Correctness Issues in OpenMP ProgramsAdvancing OpenMP for Future Accelerators10.1007/978-3-031-72567-8_11(161-175)Online publication date: 16-Sep-2024
https://doi.org/10.1007/978-3-031-72567-8_11
Wilkins MWestrick SKandiah VBernat ASuchy BDeiana ECampanoni SAcar UDinda PHardavellas NDubach CBruening DHardekopf B(2023)WARDen: Specializing Cache Coherence for High-Level Parallel LanguagesProceedings of the 21st ACM/IEEE International Symposium on Code Generation and Optimization10.1145/3579990.3580013(122-135)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3579990.3580013
Lepers BGiet JZwaenepoel WLawall JFedorova ANarayanan DDi Luna GQuerzoni L(2023)OFence: Pairing Barriers to Find Concurrency Bugs in the Linux KernelProceedings of the Eighteenth European Conference on Computer Systems10.1145/3552326.3567504(33-45)Online publication date: 8-May-2023
https://dl.acm.org/doi/10.1145/3552326.3567504
Wu WHückelheim JHovland PLuo ZSiegel S(2023)Model Checking Race-Freedom When “Sequential Consistency for Data-Race-Free Programs” is GuaranteedComputer Aided Verification10.1007/978-3-031-37703-7_13(265-287)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1007/978-3-031-37703-7_13
Westrick SArora JAcar U(2022)Entanglement detection with near-zero costProceedings of the ACM on Programming Languages10.1145/35476466:ICFP(679-710)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1145/3547646
Chabbi MRamanathan MJhala RDillig I(2022)A study of real-world data races in GolangProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523720(474-489)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523720
Xu YZhou AAgrawal KLee I(2022)PINT: Parallel INTerval-Based Race Detector2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)10.1109/IPDPS53621.2022.00087(850-861)Online publication date: May-2022
https://doi.org/10.1109/IPDPS53621.2022.00087
Yu LJin FProtze JSarkar V(2022)Leveraging the Dynamic Program Structure Tree to Detect Data Races in OpenMP Programs2022 IEEE/ACM Sixth International Workshop on Software Correctness for HPC Applications (Correctness)10.1109/Correctness56720.2022.00012(54-62)Online publication date: Nov-2022
https://doi.org/10.1109/Correctness56720.2022.00012
Saillard ESergent MAit Kaci CBarthou D(2022)Static Local Concurrency Errors Detection in MPI-RMA Programs2022 IEEE/ACM Sixth International Workshop on Software Correctness for HPC Applications (Correctness)10.1109/Correctness56720.2022.00008(18-26)Online publication date: Nov-2022
https://doi.org/10.1109/Correctness56720.2022.00008
Goodrich MJacob RSitchinava NMarx D(2021)Atomic power in forksProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458192(2141-2153)Online publication date: 10-Jan-2021
https://dl.acm.org/doi/10.5555/3458064.3458192
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Dynamic instrumentation for nested fork-join parallelism in OpenMP programs

On-the-fly detection of data races in OpenMP programs

Provably Good and Practically Efficient Parallel Race Detection for Fork-Join Programs