New Dynamic Heuristics in the Client-Agent-Server Model

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. Keywords : time-shared resources, dynamic scheduling heuristics, historical trace manager, perturbation, MCT

• Type: Conference
• Year: 2003
• Where: IPPS
• Authors: Yves Caniou, Emmanuel Jeannot
• Keywords: Distributed And Parallel Computing, Heuristics Outperform Mct, Historical Trace Manager, IPPS 2003, Task Completion Time