Skip to main content

A Testing Strategy for Nondeterministic Message Passing Programs

  • Chapter
  • 222 Accesses

Part of the The International Series in Engineering and Computer Science book series (SECS,volume 541)

Abstract

Testing and debugging of parallel programs is difficult, because apart from all errors of sequential code inconvenient effects from communication and synchronization may occur. Some common problems are connected with nondeterminism, where different results are obtained in successive program runs even if the same input data are applied. In that case, users are confronted with the irreproducibility effect, the completeness problem, and the probe effect. Furthermore, exhaustive testing is almost impossible due to the required resources and the number of executions. Therefore strategies have to be developed to support users in managing nondeterministic test case scenarios. The automatic nondeterminism tester ANT offers a solution by combining monitor overhead removal, race condition detection, and automatic event manipulation. Due to limited accuracy of the overhead removal algorithm, a tolerance interval for selecting the most probable test cases is required. A side effect of this approach is significant reduction of necessary executions, which makes extensive testing feasible in many cases.

Keywords

  • Testing
  • debugging
  • nondeterminism
  • race conditions

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/0-306-47015-2_10
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   149.00
Price excludes VAT (USA)
  • ISBN: 978-0-306-47015-8
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   199.99
Price excludes VAT (USA)
Hardcover Book
USD   249.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • C.J. Fidge. Partial Orders for Parallel Debugging. Proceedings of the Workshop on Parallel and Distributed Debugging, ACM SIGPLAN/SIGOPS, pp. 183–194, May 1988.

    Google Scholar 

  • J. Gait. The Probe Effect in Concurrent Programs. IEEE Software-Practise and Experience, Vol. 16(3), pp. 225–233, March 1986.

    Google Scholar 

  • A. Geist, A. Beguelin, J. Dongarra, W. Joang, R. Manchek, V. Sunderam. PVM 3 User’s Guide and Reference Manual. Techn. Rep. ORNL/TM-12187, Oak Ridge Natl. Lab., Oak Ridge, TN, May 1994.

    Google Scholar 

  • D. Kranzlmüller, S. Grabner and J. Volkert. Debugging with the MAD Environment. Parallel Computing, 23(1–2), pp. 199–217, Apr. 1997.

    Google Scholar 

  • D. Kranzlmüller and J. Volkert. Debugging Point-To-Point Communication in MPI and PVM. Proc. EUROPVM/MPI 98 Intl. Conference, Liverpool, GB, pp. 265–272, Sept. 1998.

    Google Scholar 

  • L. Lamport. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM, pp. 558–565, July 1978.

    Google Scholar 

  • T.J. LeBlanc and J.M. Mellor-Crummey. Debugging Parallel Programs with Instant Replay. IEEE Transactions on Computers, C-36(4): 471–481, April 1987.

    Google Scholar 

  • E. Leu, A. Schiper and A. Zramdini. Execution Replay on Distributed Memory Architectures. Proc. 2nd IEEE Symp. on Parallel & Distributed Processing, Dallas, TX, pp. 106–112, Dec. 1990.

    Google Scholar 

  • A.D. Malony and D.A. Reed. Models for Performance Perturbation Analysis. Proc. ACM/ONR Workshop on Parallel and Distributed Debugging, ACM SIGPLAN Notices, 26(12), pp. 15–25, Dec. 1991.

    CrossRef  Google Scholar 

  • Message Passing Interface Forum. MPI: A Message-Passing Interface Standards-Version 1. 1. http://www.mcs.anl.gov/mpi/, June 1995. nCUBE Corporation. nCUBE 2 Programmer’s Guide. 1992.

  • R.H.B. Netzer and B.P. Miller. Optimal Tracing and Replay for Message-Passing Parallel Programs. Proc. of Supercomputing’ 92, Minneapolis, MN (Nov. 1992).

    Google Scholar 

  • M.A. Ronsse and D. Kranzlmüller. RoltMP — Replay of Lamport Timestamps for Message Passing Systems. Proc. 6th EUROMICRO Workshop on Parallel and Distributed Processing, Madrid, Spain, pp. 87–93, Jan. 1998.

    Google Scholar 

  • F. Teodorescu and J. Chassin de Kergommeaux. On Correcting the Intrusion of Tracing Non-deterministic Programs by Software. Proc. EUROPAR’97 Parallel Processing, 3rd Intl. Euro-Par Conference, Springer, Lecture Notes in Computer Science, Vol. 1300, Passau, Germany, pp. 94–101, Aug. 1997.

    Google Scholar 

  • H. Wassermann and M. Blum. Program Result-checking: a theory of testing meets a test of theory. Proc. 35th IEEE Symp. Foundations of Computer Science, pp. 382–392, 1994.

    Google Scholar 

  • W. Wu, R. Gupta and M. Spezialetti. Experimental Evaluation of On-line Techniques for Removing Monitoring Intrusion. Proc. of SPDT’98, SIGMETRICS Symposium on Parallel and Distributed Tools, Welches, Oregon, pp. 30–39, Aug. 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2002 Kluwer Academic Publishers

About this chapter

Cite this chapter

Kranzlmüller, D., Schaubschläger, C., Volkert, J. (2002). A Testing Strategy for Nondeterministic Message Passing Programs. In: Pollard, A., Mewhort, D.J.K., Weaver, D.F. (eds) High Performance Computing Systems and Applications. The International Series in Engineering and Computer Science, vol 541. Springer, Boston, MA. https://doi.org/10.1007/0-306-47015-2_10

Download citation

  • DOI: https://doi.org/10.1007/0-306-47015-2_10

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-7923-7774-0

  • Online ISBN: 978-0-306-47015-8

  • eBook Packages: Springer Book Archive