Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Process migration
Milojičić D., Douglis F., Paindaveine Y., Wheeler R., Zhou S. ACM Computing Surveys32 (3):241-299,2000.Type:Article
Date Reviewed: Jan 1 2002

This thorough survey first defines process migration and describes its fundamental terms, features, characteristics, and goals. Examples are given from historical systems, Unix-like systems, message passing systems, microkernels, user and application specific migration, and mobile objects and agents. Four case studies cover MOSIX, Sprite, Mach, and LSF (Load Sharing Facility). These case studies are compared and contrasted with some of the other examples. Several useful tables compare the systems’ main characteristics, transparency of migration, data transfer strategies, and other attributes. The comparisons are mostly qualitative, though some quantitative information is sprinkled through the text. Consolidating this into tables would have been helpful. An extensive list of over 250 references is included. Overall this is a valuable introduction, summary and comparison for researchers, students, or developers.

Why hasn’t process migration been more successful? In the weakest section of the paper, the authors blame four misconceptions: complexity, unacceptable costs, lack of support for transparency and lack of support for heterogeneity. Yet they admit that many successful implementations illustrate these “misconceptions". Although solutions exist to these problems, they offer no system that has integrated these solutions. Moreover there are other problems which the authors claim as “true” problems: no applications need process migration, no commercial systems support it, and few users will allow remote processes on their machine. One good reason for that--security--is not discussed for any of the systems. The authors’ view of the future of process migration thus seems overly optimistic.

Reviewer:  Andrew R. Huber Review #: CR125620 (0201-0023)
Bookmark and Share
  Featured Reviewer  
 
Network Operating Systems (C.2.4 ... )
 
 
Distributed Memories (D.4.2 ... )
 
 
Distributed Systems (D.4.7 ... )
 
 
Measurements (D.4.8 ... )
 
 
Message Sending (D.4.4 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Network Operating Systems": Date
Simulations of three adaptive, decentralized controlled, job scheduling algorithms
Stankovic J. (ed) Computer Networks and ISDN Systems 8(3): 199-217, 1984. Type: Article
Nov 1 1985
Models of the task assignment problem in distributed systems
Lucertini M. (ed), Springer-Verlag New York, Inc., New York, NY, 1984. Type: Book (9780387818160)
Jul 1 1985
Operating system design; vol. 2: internetworking with XINU
Comer D., Prentice-Hall, Inc., Upper Saddle River, NJ, 1987. Type: Book (9789780136374145)
Feb 1 1988
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy