Scheduling Divisible Loads on Bus Networks with Start-Up Costs by Utilizing Multiple Data Transfer Streams: PORI

The problem of scheduling divisible loads on a distributed bus network with start-up costs is considered. In this paper, we present a novel algorithm to obtain one-round installment load distribution solutions by utilizing multiple data transfer streams. We demonstrate how our proposed algorithm works by means of multiple illustrative examples. We compare the makespan generated by our proposed algorithm with the others in difference cases. We conclude that our proposed algorithm can generate better makespans than others. The analysis provides deeper understanding of scheduling divisible loads in the more realistic model, which will allow us to design more efficient algorithms.

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

[2]  Brian D. Noble,et al.  The end-to-end performance effects of parallel TCP sockets on a lossy wide-area network , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[3]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

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

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

[6]  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..

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

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

[9]  Ronald E. Miller.  Optimization: Foundations and Applications , 1999 .

[10]  Bharadwaj Veeravalli,et al.  Scheduling divisible loads on heterogeneous linear daisy chain networks with arbitrary processor release times , 2004, IEEE Transactions on Parallel and Distributed Systems.

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

[12]  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..

[13]  Bharadwaj Veeravalli,et al.  Divisible load scheduling on arbitrary distributed networks via virtual routing approach , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

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

[15]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

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

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

[18]  J. Miller.  Numerical Analysis , 1966, Nature.

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

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

[21]  Wednesday September,et al.  2007 International Conference on Parallel Processing , 2007 .