Multi-source task scheduling in grid computing environment using linear programming

In grid computing environment the workload can be submitted by various grid users. Allocating a load to the resources from various grid users is a challenging task in grid scheduling process. So we need a better resource allocation framework to schedule the tasks from various sources to the dynamic resources. This paper introduces a new divisible load scheduling framework to map the task to the distributed resources in grid computing environment. We have developed a mathematical model to allocate tasks to resource when the task is submitted by various grid users sources with the aim of minimising the completion time of scheduling process with satisfying the budget allotted by the grid user based on divisible load theory. This model helps to estimate the resource usage cost of each source under the fluctuation of resource availability and the performance evaluation of three resource homogeneous resources and the link capacity is presented.

[1]  Henri Casanova,et al.  A realistic network/application model for scheduling divisible loads on large-scale platforms , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[2]  Thomas G. Robertazzi,et al.  Distributed computation for a tree network with communication delays , 1990 .

[3]  Debasish Ghose,et al.  Distributed Computation with Communication Delays: Asymptotic Performance Analysis , 1994, J. Parallel Distributed Comput..

[4]  Thomas G. Robertazzi,et al.  Grid scheduling divisible loads from two sources , 2009, Comput. Math. Appl..

[5]  Debasish Ghose,et al.  Multi-installment load distribution in tree networks with delays , 1995 .

[6]  Thomas G. Robertazzi,et al.  Optimal Divisible Load Scheduling and Markov Chain Models , 2003 .

[7]  Yves Robert,et al.  Optimal algorithms for scheduling divisible workloads on heterogeneous systems , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[8]  Thomas G. Robertazzi.  Processor equivalence for a linear daisy chain of load sharing processors , 1992 .

[9]  Jacek Blazewicz,et al.  Distributed Processing of Divisible Jobs with Communication Startup Costs , 1997, Discret. Appl. Math..

[10]  T.G. Robertazzi,et al.  Optimal divisible job load sharing for bus networks , 1996, IEEE Transactions on Aerospace and Electronic Systems.

[11]  Jacek Blazewicz,et al.  Scheduling Divisible Jobs on Hypercubes , 1995, Parallel Comput..

[12]  Thomas G. Robertazzi,et al.  Bus-oriented load sharing for a network of sensor driven processors , 1991, IEEE Trans. Syst. Man Cybern..

[13]  Henri Casanova,et al.  UMR: a multi-round algorithm for scheduling divisible workloads , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[14]  Maciej Drozdowski,et al.  THE PERFORMANCE LIMITS OF A TWO-DIMENSIONAL NETWORK OF LOAD-SHARING PROCESSORS , 2011 .

[15]  Dantong Yu,et al.  Data Intensive Grid Scheduling: Multiple Sources with Capacity Constraints , 2003 .

[16]  Arnold L. Rosenberg,et al.  Sharing partitionable workloads in heterogeneous NOWs: greedier is not better , 2001, Proceedings 42nd IEEE Symposium on Foundations of Computer Science.

[17]  Theron Lammie,et al.  A Linear Daisy Chain with Two Divisible Load Sources , 2005 .

[18]  T.G. Robertazzi,et al.  Multi-Source Grid Scheduling for Divisible Loads , 2006, 2006 40th Annual Conference on Information Sciences and Systems.