A Dual Heuristic Scheduling Strategy Based on Task Partition in Grid Environments

Focusing on the fact that the collection of independent tasks to be scheduled onto the grid is always on a large-scale, a conception of task partition is proposed to group tasks exclusively according to the machine that gives the earliest completion time. As a result, several tasks in different task partitions can be scheduled at the same time, which reduces the range of task searching and eliminates the re-assignment of tasks completely. Furthermore, a Task Partition-Based Heuristic (TPBH) is presented with sufferage as the first heuristic and minimum completion time as the second one. Simulation results confirm that this dual heuristic scheduling strategy can reduce both makespan and the runtime; and the larger the task set is, the better performance the algorithm shows.

[1]  Francine Berman,et al.  Heuristics for scheduling parameter sweep applications in grid environments , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[2]  Jiang Changjun,et al.  A heuristic scheduling strategy for independent tasks on grid , 2005, Eighth International Conference on High-Performance Computing in Asia-Pacific Region (HPCASIA'05).

[3]  Marty Humphrey,et al.  Security Implications of Typical Grid Computing Usage Scenarios , 2001, Proceedings 10th IEEE International Symposium on High Performance Distributed Computing.

[4]  Howard Jay Siegel,et al.  Task execution time modeling for heterogeneous computing systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[5]  Atakan Dogan,et al.  A comparison of static QoS-based scheduling heuristics for a meta-task with multiple QoS dimensions in heterogeneous computing , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[6]  Yves Robert,et al.  Scheduling tasks sharing files on heterogeneous master-slave platforms , 2004, 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings..

[7]  R. V. van Nieuwpoort,et al.  The Grid 2: Blueprint for a New Computing Infrastructure , 2003 .

[8]  Yves Robert,et al.  Scheduling Tasks Sharing Files from Distributed Repositories , 2004, Euro-Par.

[9]  Yves Robert,et al.  Scheduling Tasks Sharing Files on Heterogeneous Master-Slave Platforms , 2004, PDP.

[10]  Luo Siwei,et al.  An Object-Adjustable Heuristic Scheduling Strategy in Grid Environments , 2007 .

[11]  Gregor von Laszewski,et al.  QoS guided Min-Min heuristic for grid task scheduling , 2003, Journal of Computer Science and Technology.

[12]  Guoliang Chen,et al.  A benefit function mapping heuristic for a class of meta-tasks in grid environments , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[13]  Muthucumaru Maheswaran,et al.  Integrating trust into grid resource management systems , 2002, Proceedings International Conference on Parallel Processing.

[14]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[15]  R. F. Freund,et al.  Dynamic Mapping of a Class of Independent Tasks onto Heterogeneous Computing Systems , 1999, J. Parallel Distributed Comput..