Skip to main content

Efficient Replay of PVM Programs

  • Conference paper
  • First Online:

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

Abstract

The paper presents a definition of replay of a distributed application as a function of three parameters: depth, width, and length. It addresses the problem of nondeterminism in distributed system and proposes an efficient approach to trace a PVM application behaviour in order to eliminate races in repetited execution. Detecting races in distributed computations requires implementation of a strongly consistent system of vector clocks. Therefore a system of vector clocks was adapted for a dynamic application model. Finally it presents the architecture of a tool supporting replay of PVM applications.

This work was sponsored by INCO-Esprit KIT Project no. 997100 (Parallel Processing Tools. Integration and Results Dissemination).

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

Buying options

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. Dione, C., Feeley, M., Desbiens, J.: A Taxonomy of Distributed Debuggers Based on Execution Replay. Proc. of the International Conference on Parallel and Distributed Techniques and Applications, Sunnyvale, California (1996)

    Google Scholar 

  2. Damodaran-Kamal, S.K., Francioni, J.M.: Testing Races in Parallel Programs with an OtOt Strategy. Proc. of the 1994 International Symposium on Software Testing and Analysis (ISSTA), ACM Sigsoft, ACM Press, New York (1994) 216–227

    Chapter  Google Scholar 

  3. Fagot, A., de Kergommeaux, J.C.: Systematic Assessment of the Overhead of Tracing Parallel Programs. Proc. of PDP’96, IEEE Computer Society, (1996) 179–186

    Google Scholar 

  4. Geist, G.A., Beguelin, A., Dongarra, J.J., Jiang, W., Manchek, R., Sunderam, V.S.: PVM: Parallel Virtual Machine, A User’s Guide and Tutorial for Networked Parallel Computing. MIT Press, Cambridge, MA, (1994)

    Google Scholar 

  5. Krawczyk, H., Wiszniewski, B., Kuzora, P., Neyman, M., Proficz, J.: Integrated Static and Dynamic Analysis of PVM Programs with STEPS. Computers and Artificial Intelligence, 17(5) (1998) 441–453

    MATH  Google Scholar 

  6. Lamport, L.: Time, clocks and the ordering of events in a distributed system. Communications of ACM, 21(7) (1978) 558–565

    Article  MATH  Google Scholar 

  7. Lourenço, J., Cunha, J.C.: Replaying Distributed Applications with RPVM. Proc. of DAPSYS’98, (1998)

    Google Scholar 

  8. Lourenço, J., Cunha, J.C., Krawczyk, H., Kuzora, P., Neyman, M., Wiszniewski, B.: An integrated testing and debugging environment for parallel and distributed programs. Proc. of the 23rd Euromicro Conference (EUROMICRO’97), IEEE Computer Society Press, Budapest, Hungary, (1997) 291–298

    Google Scholar 

  9. Mackey, M.: Program Replay in PVM. Technical Report, Hewlett Packard, Concurrent Computing Department, Hewlett Packard Laboratories, (1993)

    Google Scholar 

  10. Neyman, M.: Non-deterministic Recovery of Computations in Testing of Distributed Systems. Proc. of Ninth European Workshop on Dependable Computing, (1998) 114–117

    Google Scholar 

  11. Netzer, R.B., Miller, B.P.: Optimal Tracing and Replay for debugging messagepassing parallel programs. The Journal of Supercomputing, 8(4) (1995) 371–388

    Article  Google Scholar 

  12. Raynal, M., Singhal, M.: Logical Time: Capturing Causality in Distributed Systems. IEEE Computer, 1 (1996) 49–56

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neyman, M., Bukowski, M., Kuzora, P. (1999). Efficient Replay of PVM Programs. In: Dongarra, J., Luque, E., Margalef, T. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1999. Lecture Notes in Computer Science, vol 1697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48158-3_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-48158-3_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66549-6

  • Online ISBN: 978-3-540-48158-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics