Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times

The problem of distributing and processing a divisible load in a heterogeneous linear network of processors with arbitrary processors release times is considered. A divisible load is very large in size and has computationally intensive CPU requirements. Further, it has the property that the load can be partitioned arbitrarily into any number of portions and can be scheduled onto processors independently for computation. The load is assumed to arrive at one of the farthest end processors, referred to as boundary processors, for processing. The processors in the network are assumed to have nonzero release times, i.e., the time instants from which the processors are available for processing the divisible load. Our objective is to design a load distribution strategy by taking into account the release times of the processors in such a way that the entire processing time of the load is a minimum. We consider two generic cases in which all processors have identical release times and when all processors have arbitrary release times. We adopt both the single and multiinstallment strategies proposed in the divisible load scheduling literature in our design of load distribution strategies, wherever necessary, to achieve a minimum processing time. Finally, when optimal strategies cannot be realized, we propose two heuristic strategies, one for the identical case, and the other for nonidentical release times case, respectively. Several conditions are derived to determine whether or not optimal load distribution exists and illustrative examples are provided for the ease of understanding.

[1]  Gerassimos D. Barlas.  Collection-Aware Optimum Sequencing of Operations and Closed-Form Solutions for the Distribution of a Divisible Load on Arbitrary Processor Trees , 1998, IEEE Trans. Parallel Distributed Syst..

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

[3]  Thomas G. Robertazzi,et al.  A Multi-Job Load Sharing Strategy for Divisible Jobs on Bus Networks , 1993 .

[4]  Pawel Wolniewicz,et al.  Experiments with Scheduling Divisible Tasks in Clusters of Workstations , 2000, Euro-Par.

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

[6]  Keqin Li.  Managing Divisible Load on Partitionable Networks , 1998 .

[7]  Debasish Ghose,et al.  Load Partitioning and Trade-Off Study for Large Matrix-Vector Computations in Multicast Bus Networks with Communication Delays , 1998, J. Parallel Distributed Comput..

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

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

[10]  Thomas G. Robertazzi.  Processor equivalence for daisy chain load sharing processors , 1993 .

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

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

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

[14]  Thomas G. Robertazzi,et al.  Distributed computation with communication delay (distributed intelligent sensor networks) , 1988 .

[15]  Pangfeng Liu,et al.  Experiences with Parallel N-Body Simulation , 2000, IEEE Trans. Parallel Distributed Syst..

[16]  Bin Cong,et al.  Scalable Parallel Computing: Technology, Architecture, Programming , 1999, Parallel Distributed Comput. Pract..

[17]  C. Siva Ram Murthy,et al.  Distributed computation for a hypercube network of sensor-driven processors with communication delays including setup time , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[18]  Ophir Frieder,et al.  Parallel computation in biological sequence analysis , 1998 .

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

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

[21]  Ali R. Hurson,et al.  Scheduling and Load Balancing in Parallel and Distributed Systems , 1995 .

[22]  Michael Mitzenmacher,et al.  How Useful Is Old Information? , 2000, IEEE Trans. Parallel Distributed Syst..

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

[24]  Bharadwaj Veeravalli,et al.  Access Time Minimization for Distributed Multimedia Applications , 2000, Multimedia Tools and Applications.