Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, 558–565 (July 1978)
Dinning, A., Schonberg, E.: An Empirical Comparison of Monitoring Algorithms for Access Anomaly Detection. In: 2nd Symp. on Principles and Practice of Parallel Programming, pp. 1–10. ACM (March 1990)
Netzer, R.H.B., Miller, B.P.: Improving the Accuracy of Data Race Detection. In: 3rd Symp. on Principles and Practice of Parallel Programming, pp. 133–144. ACM (April 1991)
Jun, Y., McDowell, C.E.: On-the-fly Detection of the First Races in Programs with Nested Parallelism. In: 2nd Int’l Conf. on Parallel and Distributed Processing Techniques and Applications, CSREA, pp. 1549–1560 (August 1996)
Kim, J., Jun, Y.: Scalable On-the-fly Detection of the First Races in Parallel Programs. In: Proc. of the 12nd Int’l Conf. on Supercomputing, pp. 345–352. ACM (July 1998)
Park, H., Jun, Y.: Detecting the Firtst Races in Parallel Programs with Ordered Synchronization. In: 6th Int’l Conference on Parallel and Distributed Systems (ICPADS), pp. 201–208. IEEE, Tainan (1998)
Ronsse, M., De Bosschere, K.: RecPlay: A Fully Integrated Practical Record/Replay System. Transacsion on Computer Systems 17(2), 133–152 (1999)
POSIX Standard, http://www.unix.org/version3/ieee_std.html
Banerjee, U., Bliss, B., Ma, Z., Petersen, P.: A Theory of Data Race Detection. In: Proceedings of the 2006 Workshop on PADTAD, pp. 69–78. ACM (2006)
Ha, O., Jun, Y.: Monitoring of Programs with Nested Parallelism using Efficient Thread Labeling. International Journal of u - and e - Service, Science and Technology (IJUNESST) 4(1), 21–36 (2011)
Park, H., Jun, Y.: Detecting Accesses of First Data Races in Parallel Programs with Random Synchronization. In: Proceedings International Conference, SoftTech 2012, pp. 208–210 (May 2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Park, HD., Jun, YK. (2012). Detecting First Races in Shared-Memory Parallel Programs with Random Synchronization. In: Kim, Th., Cho, Hs., Gervasi, O., Yau, S.S. (eds) Computer Applications for Graphics, Grid Computing, and Industrial Environment. CGAG GDC IESH 2012 2012 2012. Communications in Computer and Information Science, vol 351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35600-1_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-35600-1_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35599-8
Online ISBN: 978-3-642-35600-1
eBook Packages: Computer ScienceComputer Science (R0)