Restructuring Parallel Programs for On-the-Fly Race Detection^*

Abstract

Detecting races is important for debugging explicit shared- memory parallel programs, because the races result in unintended non- deterministic 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 pro- gram. Monitoring an execution of the restructured program can detect the first races in the original program, eliminating one component of the space complexity.

University Research Program supported by Ministry of Information and Communication in South Korea.