论文信息 - Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract)

Race-Condition Detection in Parallel Computation with Semaphores (Extended Abstract)

We address a problem arising in debugging parallel programs, detecting race conditions in programs using semaphores for synchronization. It is NP-complete to detect race conditions in programs that use polynomial number of semaphores [10]. We show in this paper that it remains NP-complete even if the programs are allowed to use only two semaphores, which settles the open question raised in [10]. The proof uses a technique that simulates a graph with any number of semaphores by a graph with only two semaphores.

Hsueh-I Lu | Philip N. Klein | Robert H. B. Netzer | Hsueh-I Lu | P. Klein

[1] Hussein M. Abdel-Wahab,et al. Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints , 1978, Oper. Res..

[2] Hsueh-I Lu,et al. Detecting Race Conditions in Parallel Programs that Use One Semaphore , 1993, WADS.

[3] Barton P. Miller,et al. On the Complexity of Event Ordering for Shared-Memory Parallel Program Executions , 1990, ICPP.

[4] Charles E. McDowell,et al. A Class of Synchronization Operations that Permit Efficient Race Detection , 1993, PDPTA.

[5] Charles E. McDowell,et al. Analyzing Traces with Anonymous Synchronization , 1989, ICPP.

[6] David A. Padua,et al. Event synchronization analysis for debugging parallel programs , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8] Robert H. B. Netzer,et al. Efficient Race Condition Detection for Shared-Memory Programs with Post/Wait Synchronization , 1992, International Conference on Parallel Processing.