loading...
New Dynamic Heuristics in the Client-Agent-Server Model
Nice, France April 22-April 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213200International Parallel and Distribute ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Yves Caniou, LORIA, INRIA-Lorraine
Emmanuel Jeannot, LORIA, Université Henri Poincaré
MCT is a widely used heuristic for scheduling tasks onto grid platforms. However, when dealing with many tasks, MCT tends to dramatically delay already mapped task completion time, while scheduling a new task. In this paper we propose heuristics based on two features : the historical trace manager that simulates the environment and the perturbation that defines the impact a new allocated task has on already mapped tasks. Our simulations and experiments on a real environment show that the proposed heuristics outperform MCT.
Index Terms:
time-shared resources, dynamic scheduling heuristics, historical trace manager, perturbation, MCT
Citation:
Yves Caniou, Emmanuel Jeannot, "New Dynamic Heuristics in the Client-Agent-Server Model," ipdps, pp.97b, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.