An empirical comparison of monitoring algorithms for access anomaly detection
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Analysis of event synchronization in a parallel programming tool
PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Improving the accuracy of data race detection
PPOPP '91 Proceedings of the third ACM SIGPLAN symposium on Principles and practice of parallel programming
PCF parallel Fortran extensions
ACM SIGPLAN Fortran Forum
Efficient Computation of Precedence Information in Parallel Programs
Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Detecting the First Races in Parallel Programs with Ordered Synchronization
ICPADS '98 Proceedings of the 1998 International Conference on Parallel and Distributed Systems
A practical tool for detecting races in OpenMP programs
PaCT'05 Proceedings of the 8th international conference on Parallel Computing Technologies
| Hi-index | 0.00 |
Detecting races is important for debugging explicit sharedmemory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous on-the-fly techniques to detect races in parallel programs with inter-thread coordination show serious space overhead in two components of complexity, and can not guarantee that, in an execution instance, the race detected first is not preceded by accesses that also participate in a race. This paper presents a program restructuring technique for on-the-fly race detection, which results in a serializable program preserving the semantics of original program. Monitoring an execution of the restructured program can detect the first races in the original program, eliminating one component of the space complexity.