BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR95-264
ENTRY:: August 24, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Process Migration for Heterogeneous Distributed Systems
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Bishop, Matt
AUTHOR:: Valence, Mark
AUTHOR:: Wisniewski, Leonard F.
DATE:: August 1995
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: Compressed Postscript at http://www.cs.dartmouth.edu/reports/TR95-264.ps.Z
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR95-264.pdf
ABSTRACT:: 
The policies and mechanisms for migrating processes in a distributed
system become more complicated in a heterogeneous environment, where
the hosts may differ in their architecture and operating systems.
These distributed systems include a large quantity and great diversity
of resources which may not be fully utilized without the means to
migrate processes to the idle resources.  In this paper, we present a
graph model for single process migration which can be used for load
balancing as well as other non-traditional scenarios such as migration
during the graceful degradation of a host.  The graph model provides
the basis for a layered approach to implementing the mechanisms for
process migration in a Heterogeneous Migration Facility (HMF).  HMF
provides the user with a library to automatically migrate processes
and checkpoint data.
END:: ncstrl.dartmouthcs//TR95-264