Performance effective pre-scheduling strategy for heterogeneous grid systems in the master slave paradigm

It is well known that grid technology has the ability to coordinate shared resources and scheduled tasks. However, the problem of resource management and task scheduling has always been one of the main challenges. In this paper, we present a performance effective pre-scheduling strategy for dispatching tasks onto heterogeneous processors. The main extension of this study is the consideration of heterogeneous communication overheads in grid systems. One significant improvement of our approach is that average turnaround time could be minimized by selecting the processor that has the smallest communication ratio first. The other advantage of the proposed method is that system throughput can be increased by dispersing processor idle time. Our proposed technique can be applied on heterogeneous cluster systems as well as computational grid environments, in which the communication costs vary in different clusters. To evaluate performance of the proposed techniques, we have implemented the proposed algorithms along with previous methods. The experimental results show that our techniques outperform other algorithms in terms of lower average turnaround time, higher average throughput, less processor idle time and higher processors' utilization.

[1]  Larry Carter,et al.  Scheduling strategies for master-slave tasking on heterogeneous processor platforms , 2004, IEEE Transactions on Parallel and Distributed Systems.

[2]  R. F. Freund,et al.  Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems , 1999, Proceedings. Eighth Heterogeneous Computing Workshop (HCW'99).

[3]  Francine Berman,et al.  New Grid Scheduling and Rescheduling Methods in the GrADS Project , 2004, IPDPS Next Generation Software Program - NSFNGS - PI Workshop.

[4]  Bin Yao,et al.  A taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[5]  Henri Casanova,et al.  Using TOP-C and AMPIC to Port Large Parallel Applications to the Computational Grid , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).

[6]  Yves Robert,et al.  The master-slave paradigm with heterogeneous processors , 2001, Proceedings 42nd IEEE Symposium on Foundations of Computer Science.

[7]  Francine Berman,et al.  New Grid Scheduling and Rescheduling Methods in the GrADS Project , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[8]  Kang G. Shin,et al.  A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults , 2003, IEEE Trans. Computers.

[9]  Yves Robert,et al.  Pipelining Broadcasts on Heterogeneous Platforms , 2005, IEEE Trans. Parallel Distributed Syst..

[10]  Niraj K. Jha,et al.  Safety and Reliability Driven Task Allocation in Distributed Systems , 1999, IEEE Trans. Parallel Distributed Syst..

[11]  Thomas G. Robertazzi,et al.  Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job , 1993, 1993 International Conference on Parallel Processing - ICPP'93.

[12]  Sivarama P. Dandamudi,et al.  An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers , 2001, IEEE Trans. Parallel Distributed Syst..

[13]  Thomas G. Robertazzi,et al.  Optimizing Computing Costs Using Divisible Load Analysis , 1998, IEEE Trans. Parallel Distributed Syst..

[14]  Jennifer M. Schopf,et al.  A General Architecture for Scheduling on the Grid , 2003 .

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

[16]  Jan Janecek,et al.  A near lower-bound complexity algorithm for compile-time task-scheduling in heterogeneous computing systems , 2004, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks.

[17]  Atakan Dogan,et al.  Matching and Scheduling Algorithms for Minimizing Execution Time and Failure Probability of Applications in Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[18]  Thomas G. Robertazzi,et al.  Parallel Processor Configuration Design with Processing/Transmission Costs , 2000, IEEE Trans. Computers.

[19]  Stephen A. Jarvis,et al.  Grid load balancing using intelligent agents , 2005, Future Gener. Comput. Syst..

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

[21]  Francine Berman,et al.  Adaptive Computing on the Grid Using AppLeS , 2003, IEEE Trans. Parallel Distributed Syst..

[22]  Yves Robert,et al.  A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers) , 2001, IEEE Trans. Computers.

[23]  Maozhen Li,et al.  SGrid: a service-oriented model for the Semantic Grid , 2004, Future Gener. Comput. Syst..

[24]  Yves Robert,et al.  Matrix-matrix multiplication on heterogeneous platforms , 2000, Proceedings 2000 International Conference on Parallel Processing.

[25]  Henri Casanova,et al.  Deploying fault tolerance and taks migration with NetSolve , 1999, Future Gener. Comput. Syst..

[26]  Imtiaz Ahmad,et al.  An Integrated Technique for Task Matching and Scheduling onto Distributed Heterogeneous Computing Systems , 2002, J. Parallel Distributed Comput..

[27]  Jan Janecek,et al.  A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[28]  Muthucumaru Maheswaran,et al.  Scheduling Co-Reservations with Priorities in Grid Computing Systems , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).