Space-efficient On-the-fly Race Detection for Programs with Nested Parallelism

Detecting races is important for debugging sharedmemory parallel programs, because the races result in unintended nondeterministic executions of the programs. Previous monitoring techniques for on-the-fly race detection show serious space overhead. This paper presents a new technique for on-the-fly race detection which is more efficient in space complexity than existing techniques. The programs considered in this paper have nested parallelism and no other inter-task coordination. The technique requires neither compiler support nor additional processing overhead before and after the monitoring phase. This technique, therefore, makes on-the-fly race detection more practical in debugging a large class of parallel programs. Keywords: parallel programming, debugging, race detection, on-the-fly analysis, sequential monitoring, space complexity 1 Introduction Parallel processing can be an appealing approach to improve computing power. However, it is inherently more difficult to write and d..