loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st IEEE International Conference on Distributed Computing Systems (ICDCS'01)
Dynamic Migration Algorithms for Distributed Object Systems
Mesa, AZ
April 16-April 19
ISBN: 0-7695-1077-9
V. Kalogeraki, University of California, Santa Barbara
P.M. Melliar-Smith, University of California, Santa Barbara
L.E. Moser, University of California, Santa Barbara
Abstract: Complex distributed object systems require dynamic migration algorithms that allocate and reallocate objects to respond to changes in the load or in the availability of the resources. In this paper we present the Cooling and Hot-Spot migration algorithms that reallocate objects when the load on a processor is high or when the latency of a task is high. The algorithms have been implemented as a feedback loop in the Eternal Resource Management System where information obtained from monitoring the behavior of the objects and the usage of the processors' resources is used to dynamically balance the load on the processors and improve the latency of the tasks. The cost of moving an object is justified by amortization over many method invocations, and constrains the rate at which objects are moved. The experimental results show that our algorithms guarantee steady flow of operation for the tasks and gracefully migrate objects from the processors when processor overloads and high task latencies are detected.
Citation:
V. Kalogeraki, P.M. Melliar-Smith, L.E. Moser, "Dynamic Migration Algorithms for Distributed Object Systems," icdcs, pp.0119, 21st IEEE International Conference on Distributed Computing Systems (ICDCS'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.