Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free Access

Quasi-asynchronous migration: a novel migration protocol for PVM tasks

Authors Info & Claims
Published:01 April 1999Publication History
Skip Abstract Section

Abstract

Process migration is a desirable and useful facility for the Network of Workstations (NOW). This paper presents a novel migration protocol called quasi-asynchronous migration for PVM tasks, which allows non-migrating tasks to execute during most of the time of migration. Message flushing and message delaying are the key mechanisms used in quasi-asynchronous migration. Because the protocol is implemented on top of PVM and at user-level, it is both transparent to users and portable. Both the analysis of the migration protocol and the experimental results show that quasi-asynchronous migration has lower overhead than other migration protocols.

References

  1. {1} V. S. Sunderam, G. A. Geist, J. Dongarra, and R. Manchek. The PVM concrrent computing system: Evolution, experiences and trends. Parallel Computing, 20(4):531-545, April 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. {2} Wang Dongsheng, Zheng Weimin, Pei Dan. ChaRM: a Checkpoint-based Rollback Recovery and Migration System. Journal of Software, January, 1999.Google ScholarGoogle Scholar
  3. {3} M. Rasit Eskieioglu. Design Issues of Process Migration Facilities in Distributed Systems. IEEE Technical Committee on Operating Systems Newsletter, 1989, 4(2):3-13.Google ScholarGoogle Scholar
  4. {4} Jeremy Casas, Dan L. Clark, et al. MPVM: A Migration Transparent Version of PVM. Computing Systems, 1995, 8(2):171-216.Google ScholarGoogle Scholar
  5. {5} J. Litzkow, et al. Condor -- A Hunter of Idle Workstations. In: Proc. of the 8th IEEE Intl. Conf. on Distributed Computing Systems. Los Alamitos, CA:IEEE CS Press, 1988.104-111.Google ScholarGoogle Scholar
  6. {6} T. Tannenbaum and M. Litzkow. The Condor Distributed Processing System. Dr. Dobb's Journal, 1995, (2):40-48.Google ScholarGoogle Scholar
  7. {7} James S. Plank, Micah Beck, Gerry Kingsley, and Kai Li. Libckpt: Transparent checkpointing under Unix. In Proceedings of the 1995 USENIX Technical Conference, pages 213-224, January 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. {8} L. Dikken, F. van der Linden, J. Vesseur, and P. Sloot. DynamicPVM-Dynamic Load Balancing on Parallel Systems. In: W. Gentzsch and U. Harms, editors, High-performance Computin and Networking, International Coference and Exhibition Volume II: Networking and Tools, volume 797 of Lecture Notes in Computer Science, pages 273-277. Springer Verlag, Berlin, April 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. {9} Stellner and J. Pruyne. Resource Management and Checkpointing for PVM. In: Proc. 2nd Europe PVM User Group Meeting. Lyon :Editions Hermes, 1995:31-136.Google ScholarGoogle Scholar
  10. {10} Ju Jiubin, Wei Xiaohui, Xu Gaochao et al. DPVM: an enhanced PVM supporting task migration and queuing, Chinese Journal of Computers, 1997, 20(10):872-877.Google ScholarGoogle Scholar

Index Terms

  1. Quasi-asynchronous migration: a novel migration protocol for PVM tasks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader