Skip to main content
SpringerLink
Log in
Book cover

European Parallel Virtual Machine / Message Passing Interface Users’ Group Meeting

EuroPVM/MPI 2004: Recent Advances in Parallel Virtual Machine and Message Passing Interface pp 268–276Cite as

Detecting Unaffected Race Conditions in Message-Passing Programs

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3241))

Abstract

Detecting unaffected race conditions before which no other races causally happened is important to debugging message-passing programs effectively, because such a message race can affect other races to occur or not. The previous techniques to detect efficiently unaffected races do not guarantee that all of the detected races are unaffected. This paper presents a novel technique that traces the states of the locally-first race to occur in every process, and then visualizes effectively the affect-relations of all the locally-first races to detect unaffected races.

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.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cypher, R., Leu, E.: The Semantics of Blocking and Nonblocking Send and Receive Primitives. In: 8th Int’l Parallel Proc. Symp., April 1994, pp. 729–735. IEEE, Los Alamitos (1994)

    Chapter  Google Scholar 

  2. 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, August 1994, pp. 216–227. ACM, New York (1994)

    Google Scholar 

  3. Fidge, C.J.: Partial Orders for Parallel Debugging. In: Sigplan/Sigops Workshop on Parallel and Distributed Debugging, May 1988, pp. 183–194. ACM, New York (1988)

    Chapter  Google Scholar 

  4. 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 

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

    Google Scholar 

  6. 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 

  7. 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 

  8. Kranzlmüller, D., Grabner, S., Volkert, J.: Event Graph Visualization for Debugging Large Applications. In: Sigmetrics Symp. on Parallel and Distributed Tools, May 1996, pp. 108–117. ACM, Philadelphia (1996)

    Chapter  Google Scholar 

  9. Kranzlmüller, D., Schulz, M.: Notes on Nondeterminism in Message Passing Programs. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J., Volkert, J. (eds.) PVM/MPI 2002. LNCS, vol. 2474, pp. 357–367. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Kranzlmüller, D., Volkert, J.: Why Debugging Parallel Programs Needs Visualization. In: Workshop on Visual Methods for Parallel and Distributed Programming, at Symp. on Visual Languages, September 2000, IEEE, Seattle (2000)

    Google Scholar 

  11. Kranzlmüller, D.: Event Graph Analysis for Debugging Massively Parallel Programs, Ph.D. Dissertation, Joh. Kepler University Linz, Austria (September 2000)

    Google Scholar 

  12. 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 

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

    Google Scholar 

  14. Mittal, N., Garg, V.K.: Debugging Distributed Programs using Controlled Re-execution. In: 19th Annual Symp. on Principles of Distributed Computing, pp. 239–248. ACM, Portland (2000)

    Google Scholar 

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

    Google Scholar 

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

    Chapter  Google Scholar 

  17. Netzer, R.H.B., Miller, B.P.: Optimal Tracing and Replay for Debugging Message-Passing Parallel Programs. In: Supercomputing, November 1992, pp. 502–511. IEEE/ACM (1992)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Gyeongsang National University, Chinju, 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. GUP, Institute of Graphics and Parallel Processing, Johannes Kepler University, Altenbergerstraße 69, A-4040, Linz, Austria

    Dieter Kranzlmüller

  2. MTA SZTAKI, Computer and Automation Research Institute, Hungarian Academy of Sciences, P.O. Box 63, H-1518, Hungary

    Péter Kacsuk

  3. Computer Science Department, University of Tennessee, TN 37996-3450, Knoxville, USA

    Jack Dongarra

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, MY., Jun, YK. (2004). Detecting Unaffected Race Conditions in Message-Passing Programs. In: Kranzlmüller, D., Kacsuk, P., Dongarra, J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2004. Lecture Notes in Computer Science, vol 3241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30218-6_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30218-6_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23163-9

  • Online ISBN: 978-3-540-30218-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation