Abstract
It is important to debug unintended data races in OpenMP programs efficiently, because such programs are often complex and long-running. Previous tools for detecting the races does not provide any effective facility for understanding the complexity of threads involved in the reported races. This paper presents a thread visualization tool to present a partial order of threads executed in the traced programs with a scalable graph of abstract threads upon a three-dimensional cone. The scalable thread visualization is proved to be effective in debugging races using a set of synthetic programs.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dinning, A., Schonberg, E.: An Empirical Comparison of Monitoring Algorithms for Access Anomaly Detection. In: 2nd Symp. on Principles and Practice of Parallel Programming, March 1990, pp. 1–10. ACM Press, New York (1990)
Dinning, A., Schonberg, E.: Detecting Access Anomalies in Programs with Critical Sections. In: 2nd Workshop on Parallel and Distributed Debugging, May 1991, pp. 85–96. ACM Press, New York (1991)
Intel Corp.: Getting Started with the Intel C++ Compiler 9.0 for Windows. Intel Corp., Santa Clara, USA (2004)
Intel Corp.: Getting Started with the Intel Thread Checker. Intel Corp., Santa Clara, USA (2004)
Intel Corp., Intel Thread Checker for Windows 3.0 Release Notes. Intel Corp., Santa Clara, USA (2005)
Intel Corp., VTune(TM) Performance Analyzer 8.0 Release Notes. Intel Corp., Santa Clara, USA (2006)
Jun, Y., Koh, K.: On-the-fly Detection of Access Anomalies in Nested Parallel Loops. In: 3rd ACM/ONR Workshop on Parallel and Distributed Debugging, May 1993, pp. 107–117. ACM Press, New York (1993)
Kim, Y., et al.: A Practical Tool for Detecting Races in OpenMP Programs. In: Malyshkin, V.E. (ed.) PaCT 2005. LNCS, vol. 3606, pp. 321–330. Springer, Heidelberg (2005)
Kim, Y., Jun, Y.: An Optimal Tool for Verifying Races in OpenMP Programs. In: 06 Int’l Conference on Hybrid Information Technology, SERC, Cheju Island, Korea (Nov. 2006)
Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Comm. of ACM 21(7), 558–565 (1978)
Mellor-Crummey, J.M.: On-the-fly Detection of Data Races for Programs with Nested Fork-Join Parallelism. In: Supercomputing, Nov. 1991, pp. 24–33. IEEE Computer Society Press, Los Alamitos (1991)
Netzer, R.H.B., Miller, B.P.: What Are Race Conditions? Some Issues and Formalizations. Letters on Programming Lang. and Systems 1(1), 74–88 (1992)
Nudler, I., Rudolph, L.: Tools for the Efficient Development of Efficient Parallel Programs. In: 1st Israeli Conference on Computer System Engineering (1986)
OpenMP Architecture Review Board, OpenMP Application Programs Interface, Version 2.5 (May 2005)
Jun, Y.-K., Park, S.-H., Park, M.-Y.: A Comparison of Scalable Labeling Schemes for Detecting Races in OpenMP Programs. In: Eigenmann, R., Voss, M.J. (eds.) WOMPAT 2001. LNCS, vol. 2104, Springer, Heidelberg (2001)
Petersen, P., Shah, S.: OpenMP Support in the Intel Thread Checker. In: Voss, M.J. (ed.) WOMPAT 2003. LNCS, vol. 2716, pp. 1–12. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Kim, YJ., Lim, JS., Jun, YK. (2007). Scalable Thread Visualization for Debugging Data Races in OpenMP Programs. In: Cérin, C., Li, KC. (eds) Advances in Grid and Pervasive Computing. GPC 2007. Lecture Notes in Computer Science, vol 4459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72360-8_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-72360-8_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72359-2
Online ISBN: 978-3-540-72360-8
eBook Packages: Computer ScienceComputer Science (R0)