Event synchronization analysis for debugging parallel programs

Perry A. Emrath, Sanjoy Ghosh, David A. Padua

Research output: Contribution to conferencePaper

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 by shared variables in a parallel program, and the tasks constituting the program may need to be synchronized when accessing these variables. This problem is discussed, and a method for automatically detecting nondeterminacy in parallel programs that utilize event-style synchronization instructions, using the Post, Wait, and Clear primitives, is presented. 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 is an algorithm that computes such an execution order and yields a task graph to which a nondeterminacy detection algorithm can be applied.

Original languageEnglish (US)
Pages580-588
Number of pages9
DOIs
StatePublished - Jan 1 1989
EventProceedings: Supercomputing '89 - Reno, NV, USA
Duration: Nov 13 1989Nov 17 1989

Other

OtherProceedings: Supercomputing '89
CityReno, NV, USA
Period11/13/8911/17/89

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Event synchronization analysis for debugging parallel programs'. Together they form a unique fingerprint.

  • Cite this

    Emrath, P. A., Ghosh, S., & Padua, D. A. (1989). Event synchronization analysis for debugging parallel programs. 580-588. Paper presented at Proceedings: Supercomputing '89, Reno, NV, USA, . https://doi.org/10.1145/76263.76329