Space-Efficient First Race Detection in Shared Memory Programs with Nested Parallelism
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Restructuring Parallel Programs for On-the-Fly Race Detection
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Dynamic testing of flow graph based parallel applications
PADTAD '08 Proceedings of the 6th workshop on Parallel and distributed systems: testing, analysis, and debugging
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 shared-memory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous on-the-fly techniques to detect races in programs with inter-thread coordination such as ordered synchronization cannot guarantee that the race detected first is not preceded by events that also participate in a race.This paper presents a new two-pass on-the-fly algorithm to detect the first races in such parallel programs. Detecting the first races is important in debugging, because the removal of such races may make other races disappear including those detected first by the previous techniques. Therefore, this technique makes on-the-fly race detection more effective and practical in debugging parallel programs.