Visualization tool for debugging data races in structured fork-join parallel programs

  • Kang, M.-S.; 
  • Ha, O.-K.; 
  • Jun, Y.-K.
Citations

SCOPUS

2

초록

Ensuring the reliability of structured fork-join parallel programs is difficult because the potential for subtle interactions between concurrent threads can cause concurrency bugs, such as data races, which are hard to detect, reproduce, and eliminate. The visualization for the executions of the programs may offer effective debugging environments with intuitively understanding. Unfortunately, visualization techniques for structured fork-join parallel programs still also difficult to represent and analyze the information of programs executions, because the information for analyzing thread executions and relevant events to data races are increased exponentially in proportion to maximum parallelism of the program. This paper presents a visualization tool that offers overall information for detecting data races by grouping and abstracting thread executions and accesses to shared variables. Moreover, the tool provides an effective approach to debug data races by indicating locations of the defects. ? 2014 SERSC.

키워드

Data races; Effective debugging; Structured fork-join parallelism; Visualization
제목
Visualization tool for debugging data races in structured fork-join parallel programs
저자
Kang, M.-S.; Ha, O.-K.; Jun, Y.-K.
DOI
10.14257/ijseia.2014.8.4.17
발행일
2014
유형
Article
저널명
International Journal of Software Engineering and its Applications
권
8
호
4
페이지
157 ~ 168