Detecting First Races in Shared-Memory Parallel Programs with Random Synchronization

초록

Detecting data races is a hard problem when debugging shared memory parallel programs, because the races could exhibit unpredictable results in execution of programs. It is even harder for programmers to decide whether or how the reported data races can appear in the actual program executions. Previous techniques for detecting races cannot provide method to discover first races in parallel programs with random synchronization. We present an algorithm, in this paper, which extracts first races to occur by comparing the concurrency of the traced information with the candidate accesses which are from a particular execution of parallel programs.

키워드