Advertisement

Extending PVM with consistent cut capabilities: Application Aspects and Implementation Strategies

  • Andrea Clematis
  • Vittoria Gianuzzi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1697)

Abstract

Message passing libraries are now widely used to develop parallel and distributed applications. Despite different services are provided by the available packages, still little support is given for distributed consistent cut, a facility which constitutes the base for higher level services both at system level (e.g. distributed debugging and fault tolerance), and at the application level (e.g. distributed simulation). In this paper we discuss different strategies to integrate a consistent cut protocol in PVM system.

Keywords

Control Message Message Complexity Starter Process High Level Service Virtual Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chandy K., Lamport L.: Distributed snapshots: determining global states of distributed systems. ACM Trans. Comput. Systems 3(1) (1985) 63–75CrossRefGoogle Scholar
  2. 2.
    Clematis A., Gianuzzi V.: CPVM-Extending PVM for Consistent Checkpointing. Euromicro Workshop on Parallel and Distributed Processing (1996) 67–74Google Scholar
  3. 3.
    Clematis A., Deconinck G., Gianuzzi V.: A flexible state-saving library for messagepassing systems. 6th Euromicro Workshop on Parallel and Distributed Processing (1998)Google Scholar
  4. 4.
  5. 5.
    Deconinck G. et al. Fault Tolerance in Massively Parallel Systems. Transputer Communications 2(4) (1994) 241–257Google Scholar
  6. 6.
    Geist A., Beguelin A., Dongarra J., Jiang W., Manchek R., Sunderam R.: PVM: Parallel Virtual Machine-A User Guide and Tutorial for Networked Parallel Computing. The MIT Press Cambridge Ma. (1994)zbMATHGoogle Scholar
  7. 7.
    V. Gianuzzi. An Optimal Snapshot Protocol for Acknowledged Message Passing, Tech. Rep. DISI-TR-96-6, 1996.Google Scholar
  8. 8.
    Jefferson D.R.: Virtual time. ACM Trans. Programming Languages Syst. 7(3) (1985) 404–425CrossRefMathSciNetGoogle Scholar
  9. 9.
    Jefferson D.R. et al.: Distributed simulation and the Time Warp Operating System. 12th SIGOPS (1987) 77–93Google Scholar
  10. 10.
    Lai T.-H., Yang T.-H.: On distributed snapshots. Inform. Process. Lett. 25 (1987) 153–158zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    León J., Fisher A.L., Steenkiste P.: Fail-safe PVM: a portable package for distribuited programming with transparent recovery. CMU-CS-93-124 (1993)Google Scholar
  12. 12.
    Wismüller R.: Debugging message passing programs using invisible message tags, in Recent Advances in Parallel Virtual Machine and Message Passing Interface, M. Bubak, J. Dongarra and J. Wasniewski (Eds.), LNCS 1332 (1997), (295–302)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Andrea Clematis
    • 1
  • Vittoria Gianuzzi
    • 2
  1. 1.IMA - CNRGenovaItaly
  2. 2.DISI, Universitá di GenovaGenovaItaly

Personalised recommendations