ACM Home Page
Please provide us with feedback. Feedback
Event synchronization analysis for debugging parallel programs
Full text PdfPdf (854 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 1989 ACM/IEEE conference on Supercomputing table of contents
Reno, Nevada, United States
Pages: 580 - 588  
Year of Publication: 1989
ISBN:0-89791-341-8
Authors
P. A. Emrath  Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 305 Talbot Laboratory, 104 South Wright Street, Urbana, Illinois
S. Chosh  Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 305 Talbot Laboratory, 104 South Wright Street, Urbana, Illinois
D. A. Padua  Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, 305 Talbot Laboratory, 104 South Wright Street, Urbana, Illinois
Sponsors
Argonne Natl Lab : Argonne National Lab
IEEE-CS : Computer Society
NASA : National Aeronatics and Space Administration
SIGARCH: ACM Special Interest Group on Computer Architecture
Los Alamos National Labs : Los Alamos National Labs
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 18,   Citation Count: 16
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

One of the major difficulties of explicit parallel programming for a shared memory machine model is detecting the potential for nondeterminacy and identifying its causes. There will often be shared variables in a parallel program, and the tasks comprising the program may need to be synchronized when accessing these variables. This paper discusses this problem and presents a method for automatically detecting non-determinacy in parallel programs that utilize event style synchronization instructions, using the Post, Wait, and Clear primitives. With event style synchronization, especially when there are many references to the same event, the difficulty lies in computing the execution order that is guaranteed given the synchronization instructions and the sequential components of the program. The main result in this paper is an algorithm that computes such an execution order and yields a Task Graph upon which a nondeterminacy detection algorithm can be applied. We have focused on events because they are a frequently used synchronization mechanism in parallel versions of Fortran, including Cray [Cray87], IBM [IBM88], Cedar [GPHL88], and PCF Fortran [PCF88].


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.

 
Alli85
FX/Series Architecture Manual Concurrency Supplement, Alliant Computer Systems Corp., April 1985.
 
AlPa87
Todd R. Allen, and David A. Padua. Debugging Fortran on a Shared Memory Machine, Proceedings of the 1987 International Conference on Parallel Processing, pp. 721-727, Aug. 1987.
 
Bane88
CaSu88
 
Cray87
Cray X.MP Multitasking Programmer's Reference Manual, Cray Research, Inc., 1987.
EmPa88
 
GPHL88
 
IBM88
IBM Parallel FORTRAN Language and Library Reference, IBM Corp., March 1988.
 
KDLS86
D. Kuck, E. Davidson, D. Lawrie, and A. Sameh. Parallel supercomputin9 todav and the Cedar approach, Science, vol. 231, pp. 967'-974, Feb. 1986.
MiCh88
 
MiPa87
 
PCF88
PCF Fortran: Language Definition, The Parallel Computing Forum, August 1988.
Scho89

CITED BY  16

Collaborative Colleagues:
P. A. Emrath: colleagues
S. Chosh: colleagues
D. A. Padua: colleagues