Compile-time detection of race conditions in a parallel program

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Compile-time detection of race conditions in a parallel program

Full text

Pdf (1.07 MB)

Source

International Conference on Supercomputing archive
Proceedings of the 3rd international conference on Supercomputing table of contents

Crete, Greece

Pages: 175 - 185

Year of Publication: 1989

ISBN:0-89791-309-4

Authors

Vasanth Balasundaram	Dept. of Computer Science, Rice University, P.O. Box 1892, Houston, TX
Ken Kennedy	Dept. of Computer Science, Rice University, P.O. Box 1892, Houston, TX

Sponsors

Computer Tech Inst. : Computer Technology Institute
SIGARCH: ACM Special Interest Group on Computer Architecture
SIAM : Society for Industrial and Applied Mathematics
AICA : Assoc Italianai de Calcolo Automatico

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 23, Citation Count: 12

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/318789.318809 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	T. R. Allen and D. A. Padua. Debugging Fortran on a shared memory machine. Proceedings of the international Conference on Parallel Processing, 1987.
	2	W. Appelbe and C. McDowell. Anomaly reporting- a tool for debugging and developing parallel numerical algorithms. First international Conference on Supercomputers, Florida, Dec 1985.
	3	Vasanth Balasundaram , K. Kennedy, Interactive parallelization of numerical scientific programs, 1989
	4	V. Balasundaram , K. Kennedy, A technique for summarizing data access and its use in parallelism enhancing transformations, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.41-53, June 19-23, 1989, Portland, Oregon, United States
	5	David Callahan , Jaspal Sublok, Static analysis of low-level synchronization, ACM SIGPLAN Notices, v.24 n.1, p.100-111, Jan. 1989
	6	Perry A. Emrath , David A. Padua, Automatic detection of nondeterminacy in parallel programs, ACM SIGPLAN Notices, v.24 n.1, p.89-99, Jan. 1989
	7	J. Eve and R. Kurki-Suonio. On computing the transitive closure of a relation. Acta Informatica, 8:303-314, 1978.
	8	B. P. Miller , Jong-Deok Choi, A mechanism for efficient debugging of parallel programs, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.135-144, June 20-24, 1988, Atlanta, Georgia, United States
	9	D. Schonberg, On-the-fly detection of access anomalies, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.285-297, June 19-23, 1989, Portland, Oregon, United States
	10	Dennis Shasha , Marc Snir, Efficient and correct execution of parallel programs that share memory, ACM Transactions on Programming Languages and Systems (TOPLAS), v.10 n.2, p.282-312, April 1988 [doi>10.1145/42190.42277]
	11	R.E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2), 1982.
	12	R. N. Taylor. Complexity of analyzing the synchronization structure of concurrent programs. Aria Infovmatica, 19:57-84, 1983.
	13	Richard N. Taylor, A general-purpose algorithm for analyzing concurrent programs, Communications of the ACM, v.26 n.5, p.361-376, May 1983 [doi>10.1145/69586.69587]

CITED BY 12

	Jong-Deok Choi , Sang Lyul Min, Race Frontier: reproducing data races in parallel-program debugging, ACM SIGPLAN Notices, v.26 n.7, p.145-154, July 1991
	Robert H. B. Netzer , Barton P. Miller, What are race conditions?: Some issues and formalizations, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.1, p.74-88, March 1992
	Dirk Grunwald , Harini Srinivasan, Data flow equations for explicitly parallel programs, ACM SIGPLAN Notices, v.28 n.7, p.159-168, July 1993
	Sang L. Min , Jong-Deok Choi, An efficient cache-based access anomaly detection scheme, ACM SIGARCH Computer Architecture News, v.19 n.2, p.235-244, Apr. 1991
	Eli Pozniansky , Assaf Schuster, Efficient on-the-fly data race detection in multithreaded C++ programs, ACM SIGPLAN Notices, v.38 n.10, October 2003
	Radu Rugina , Martin C. Rinard, Symbolic bounds analysis of pointers, array indices, and accessed memory regions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.2, p.185-235, March 2005
	Bohuslav Krena , Zdenek Letko , Rachel Tzoref , Shmuel Ur , Tomáš Vojnar, Healing data races on-the-fly, Proceedings of the 2007 ACM workshop on Parallel and distributed systems: testing and debugging, July 09-09, 2007, London, United Kingdom
	Radu Rugina , Martin C. Rinard, Pointer analysis for structured parallel programs, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.1, p.70-116, January 2003
	Sarita V. Adve , Mark D. Hill , Barton P. Miller , Robert H. B. Netzer, Detecting data races on weak memory systems, ACM SIGARCH Computer Architecture News, v.19 n.3, p.234-243, May 1991
	Kourosh Gharachorloo , Phillip B. Gibbons, Detecting violations of sequential consistency, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.316-326, July 21-24, 1991, Hilton Head, South Carolina, United States
	D. Callahan , K. Kennedy , J. Subhlok, Analysis of event synchronization in a parallel programming tool, ACM SIGPLAN Notices, v.25 n.3, p.21-30, Mar. 1990
	Cherri M. Pancake , Sue Utter, A bibliography of parallel debuggers, 1990 edition, ACM SIGPLAN Notices, v.26 n.1, p.21-37, Jan. 1991