earticle

논문검색

Visualization Tool for Debugging Data Races in Structured Fork-join Parallel Programs

초록

영어

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.

목차

Abstract
 1. Introduction
 2. Background
  2.1. Data Races in Structured Fork-join Parallelism
  2.2. Visualization for Detecting Data Races
 3. Design of Space Efficient Visualization
  3.1. Visualization Symbols
  3.2. Grouping Thread Segments
  3.3. Abstracting Parallel Regions and Indicating Data Races
 4. Evaluation
  4.1 Implementation
  4.2. Experimentation
 5. Conclusion
 Acknowledgements
 References

저자정보

  • Myeong-Sin Kang Department of Informatics, Gyeongsang National University
  • Ok-Kyoon Ha Engineering Research Institute, Gyeongsang National University
  • Yong-Kee Jun Department of Informatics, Gyeongsang National University

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.