Scheduling multiple divisible and indivisible tasks on bus networks

The problem of scheduling multiple divisible and indivisible tasks on a distributed bus network with start-up costs is considered. In this paper, we propose a novel algorithm to schedule both divisible and indivisible tasks. We utilize one-round installment load distribution strategy for scheduling divisible tasks. We analyze the properties of our proposed algorithm. We demonstrate how our proposed algorithm works by means of multiple illustrative examples. We measure the performance of our proposed algorithm. We conclude our proposed algorithm is more feasible than others. The analysis provides deeper understanding of scheduling multiple divisible and indivisible tasks in the more realistic model, which will allow us to design more efficient algorithms.

[1]  Emmanuel Jeannot,et al.  On the distribution of sequential jobs in random brokering for heterogeneous computational grids , 2006, IEEE Transactions on Parallel and Distributed Systems.

[2]  Henri Casanova,et al.  Multiround algorithms for scheduling divisible loads , 2005, IEEE Transactions on Parallel and Distributed Systems.

[3]  Sameer M. Bataineh,et al.  Efficient scheduling algorithm for divisible and indivisible tasks in loosely coupled multiprocessor systems , 1994, Softw. Eng. J..

[4]  Kristina Lerman,et al.  Resource allocation in the grid using reinforcement learning , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[5]  Ben Juurlink,et al.  Performance relevant issues for parallel computation models , 2001 .

[6]  Nimrod Megiddo,et al.  Advances in Economic Theory: On the complexity of linear programming , 1987 .

[7]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[8]  Bharadwaj Veeravalli,et al.  Efficient Scheduling Strategies for Processing Multiple Divisible Loads on Bus Networks , 2002, J. Parallel Distributed Comput..

[9]  Debasish Ghose,et al.  Foreword (Special Issue of Cluster Computing on Divisible Load Scheduling) , 2004, Cluster Computing.

[10]  Jie Hu,et al.  Scheduling Divisible Loads on Bus Networks with Arbitrary Processor Release Time and Start-Up Costs: XRMI , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.

[11]  Henryk Wozniakowski,et al.  Complexity of linear programming , 1982, Oper. Res. Lett..

[12]  Bharadwaj Veeravalli,et al.  Distributed Image Processing On A Network Of Workstations , 2003 .

[13]  Debasish Ghose,et al.  Scheduling Divisible Loads in Parallel and Distributed Systems , 1996 .

[14]  Maciej Drozdowski,et al.  Selected problems of scheduling tasks in multiprocessor computer systems , 1997 .

[15]  Donna Calhoun,et al.  PARDEX: a program for computing the environmental risk associated with accidental explosions , 1994 .

[16]  Henri Casanova,et al.  Scheduling divisible loads on star and tree networks: results and open problems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[17]  Hai Jin,et al.  Challenges of Grid Computing , 2005, WAIM.

[18]  Thomas G. Robertazzi,et al.  Ten Reasons to Use Divisible Load Theory , 2003, Computer.

[19]  Bharadwaj Veeravalli,et al.  On the Influence of Start-Up Costs in Scheduling Divisible Loads on Bus Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[20]  Thomas G. Robertazzi,et al.  Divisible Load Scheduling for Grid Computing , 2003 .

[21]  Charles P. Neuman.  On the LU factorization of Hessenberg matrices , 1989, IEEE Trans. Syst. Man Cybern..

[22]  Debasish Ghose,et al.  Large matrix-vector products on distributed bus networks with communication delays using the divisible load paradigm: performance analysis and simulation , 2001, Math. Comput. Simul..

[23]  Debasish Ghose,et al.  Divisible Load Theory: A New Paradigm for Load Scheduling in Distributed Systems , 2004, Cluster Computing.

[24]  T. Bewley.  Advances in Economic Theory: Fifth World Congress , 2009 .

[25]  S. Bataineh,et al.  A heuristic algorithm for scheduling multiclasses of tasks in multiprocessor systems , 1998 .

[26]  Maciej Drozdowski,et al.  Scheduling Multiple Divisible Loads , 2006, Int. J. High Perform. Comput. Appl..

[27]  Richard P. Martin,et al.  Modeling communication pipeline latency , 1998, SIGMETRICS '98/PERFORMANCE '98.

[28]  Jacek Blazewicz,et al.  Divisible task scheduling - Concept and verification , 1999, Parallel Comput..

[29]  V Bharadwaj,et al.  Scheduling divisible loads in bus networks with arbitrary processor release times , 1996 .