Skip to main content
Springer Nature Link
Log in

Detecting Unaffected Message Races in Parallel Programs

  • Conference paper
Advances in Grid and Pervasive Computing (GPC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3947))

Included in the following conference series:

Abstract

Detecting unaffected race conditions is important to debugging message-passing programs effectively, because such a message race can affect other races to occur or not. Unfortunately, the previous technique to efficiently detect unaffected races does not guarantee that all of the detected races are unaffected. This paper presents a novel technique that manages the states of the detected races by examining if every received message is affected until the execution terminates. Our technique guarantees to efficiently detect unaffected races, because it maintains affects-relations of the races all along the execution of program.

This work was supported in part by Grant No. R05-2003-000-12345-0 from the Basic Research Program of the Korea Science and Engineering Foundation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Claudio, A.P., Cunha, J.D.: A Race Detection Mechanism Embedded in a Conceptual Model for the Debugging of Message-Passing Distributed Programs. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 57–65. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  2. Cypher, R., Leu, E.: Efficient Race Detection for Message-Passing Programs with Nonblocking Sends and Receives. In: 7th Symp. on Parallel and Distributed Processing, pp. 534–541. IEEE, Los Alamitos (1995)

    Google Scholar 

  3. Damodaran-Kamal, S.K., Francioni, J.M.: Nondeterminacy: Testing and Debugging in Message Passing Parallel Programs. In: ACM/ONR Workshop on Parallel and Distributed Debugging. Sigplan Notices, vol. 28(12), pp. 118–128. ACM, New York (1993)

    Google Scholar 

  4. Damodaran-Kamal, S.K., Francioni, J.M.: Testing Races in Parallel Programs with an OtOt Strategy. In: Int’l Symp. on Software Testing and Analysis, pp. 216–227. ACM, New York (1994)

    Google Scholar 

  5. Fidge, C.J.: Partial Orders for Parallel Debugging. In: SIGPLAN/SIGOPS Workshop on Parallel and Distributed Debugging, pp. 183–194. ACM, New York (1988)

    Google Scholar 

  6. Foster, I., Kesselman, C.: The Grid: Blueprint for a New Computing Infrastructure. Morgan-Kaufmann, San Francisco (1999)

    Google Scholar 

  7. Geist, A., Beguelin, A., Dongarra, J., Jiang, W., Manchek, R., Sunderam, V.: PVM: Parallel Virtual Machine. In: A Users Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge (1994)

    Google Scholar 

  8. Gropp, W., Lusk, E.: User’s Guide for Mpich, A Portable Implementation of MPI, TR-ANL-96/6, Argonne National Laboratory (1996)

    Google Scholar 

  9. Gropp, W., Lusk, E.: Reproducible Measurements of MPI Performance Characteristics. In: Margalef, T., Dongarra, J., Luque, E. (eds.) PVM/MPI 1999. LNCS, vol. 1697, pp. 11–18. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  10. Karonis, N., Toonen, B., Foster, I.: MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface. J. of Parallel and Distributed Computing 63(5), 551–563 (2003)

    Article  MATH  Google Scholar 

  11. Kilgore, R., Chase, C.: Re-execution of Distributed Programs to Detect Bugs Hidden by Racing Messages. In: 30th Annual Hawaii Int’l. Conf. on System Sciences, January 1997, vol. 1, pp. 423–432 (1997)

    Google Scholar 

  12. Krammer, B., Müller, M.S., Resch, M.M.: MPI Application Development Using the Analysis Tool MARMOT. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3038, pp. 464–471. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  13. Lamport, L.: Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  14. Lei, Y., Tai, K.: Efficient Reachability Testing of Asynchronous Message- Passing Programs. In: 8th Int’l Conf. on Engineering of Complex Computer Systems, pp. 35–44. IEEE, Los Alamitos (2002)

    Google Scholar 

  15. Mucci, P.J., London, K.: The MPBench Report, CEWES MSRC/PET TR- 98-26, Nichols Research, Programming Environment Training (PET), Major Shred Res. Center (MSRC), DoD HPC Modernization Program CEWES (March 1998)

    Google Scholar 

  16. Mattern, F.: Virtual Time and Global States of Distributed Systems. In: Parallel and Distributed Algorithms, pp. 215–226. Elsevier Science, North Holland, Amsterdam (1989)

    Google Scholar 

  17. Netzer, R.H.B., Brennan, T.W., Damodaran-Kamal, S.K.: Debugging Race Conditions in Message-Passing Programs. In: ACM Sigmetrics Symp. on Parallel and Distributed Tools (SPDT), pp. 31–40. ACM, New York (1996)

    Chapter  Google Scholar 

  18. Netzer, R.H.B., Miller, B.P.: Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs. In: Int’l Conf. on High Perf. Networking and Computing, Minneapolis, Minn., November 1992, pp. 502–511. ACM/IEEE (1992)

    Google Scholar 

  19. Park, M., Jun, Y.: Detecting Unaffected Race Conditions in Message-Passing Programs. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds.) EuroPVM/MPI 2004. LNCS, vol. 3241, pp. 268–276. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Pallas GmbH, Pallas MPI Benchmarks - PMB, Pallas GmbH, Hermuelheimer Street 10, 50321 Bruehl, Germany (March 2000)

    Google Scholar 

  21. Park, M., Kim, Y., Kang, M., Jun, Y.: Improving On-the-fly Race Detection for Message-Passing Programs. In: Int’l. Conf. of Computational Methods in Sciences and Engineering (ICCMSE), Korinthos, Greece. Lecture Series on Computer and Computational Science, vol. 4, pp. 449–454. Brill Academic (2005)

    Google Scholar 

  22. Park, M., Park, S., Bae, S., Jun, Y.: Scalable Race Visualization for Debugging Message-Passing Programs. In: Workshop on State-of-the-Art in Scientific Computing (PARA), Copenhagen, Denmark, June 2004, pp. 179–188 (2004)

    Google Scholar 

  23. Snir, M., Otto, S., Huss-Lederman, S., Walker, D., Dongarra, J.: MPI: The Complete Reference. MIT Press, Cambridge (1996)

    Google Scholar 

  24. Tai, K.C.: Race Analysis of Traces of Asynchronous Message-Passing Programs. In: Int’l. Conf. on Dist. Computing Systems (ICDCS), pp. 261–268. IEEE, Los Alamitos (1997)

    Google Scholar 

  25. Wang, W., Fang, B., Zhang, H., Yao, Y.: Ad Hoc Debugging Environment for Grid Applications. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds.) GCC 2004. LNCS, vol. 3251, pp. 113–120. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, Gyeongsang National University, Jinju, 660-701, South Korea

    Mi-Young Park & Yong-Kee Jun

Authors
  1. Mi-Young Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong-Kee Jun
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, National Tsing Hua University, 30013, Hsinchu, Taiwan

    Yeh-Ching Chung

  2. IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA

    José E. Moreira

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, MY., Jun, YK. (2006). Detecting Unaffected Message Races in Parallel Programs. In: Chung, YC., Moreira, J.E. (eds) Advances in Grid and Pervasive Computing. GPC 2006. Lecture Notes in Computer Science, vol 3947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11745693_19

Download citation

  • DOI: https://doi.org/10.1007/11745693_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33809-3

  • Online ISBN: 978-3-540-33810-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics