A practical method for on-the-fly data race detection

Detecting data race is an important debugging problem that should be solved in the shared-memory parallel programs. To attack this problem, considerable works have been developed in the literature. In particular, detecting data races on-the-fly is regarded as more efficient strategy. However, the time and space overhead required to perform the technique on-the-fly is still considered as a serious problem. This paper presents a practical method to improve the problem. The target model of our method for detecting data race on-the-fly is the shared-memory programs with nested fork-join parallelism. The method presented here shows that it is more efficient in the complexity of space and time over previous techniques. Thus, it makes the technique for detecting data race on-the-fly more practical. The worst-case of space and time required to apply our method to the parallel programs are O(VT) and O(T) respectively.