Equal allocation scheduling for data intensive applications

A new analytical model for equal allocation of divisible computation and communication load is developed. Equal allocation of load is attractive in multiple processor systems when real time information on processor and link capacity that is necessary for optimal scheduling is not available. The model includes a detailed accounting of solution reporting time. Equal allocation scheduling is compared with sequential scheduling and a new type of multi-installment scheduling. Aerospace applications include the processing of satellite imagery, radar, and sensor networks.

[1]  Thomas G. Robertazzi,et al.  Naive versus Optimal Scheduling for Data Intensive Applications , 2003 .

[2]  Debasish Ghose,et al.  Optimal Sequencing and Arrangement in Distributed Single-Level Tree Networks with Communication Delays , 1994, IEEE Trans. Parallel Distributed Syst..

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

[4]  Thomas G. Robertazzi,et al.  Optimal load sharing for a divisible job on a bus network , 1992 .

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

[6]  Stephan Olariu,et al.  Time- and VLSI-Optimal Sorting on Enhanced Meshes , 1998, IEEE Trans. Parallel Distributed Syst..

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

[8]  H. V. Jagadish,et al.  Partitioning Techniques for Large-Grained Parallelism , 1988, IEEE Trans. Computers.

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

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

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

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

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

[14]  Arnold L. Rosenberg,et al.  Optimal sharing of bags of tasks in heterogeneous clusters , 2003, SPAA '03.

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

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

[17]  T.G. Robertazzi,et al.  Performance limits for processor networks with divisible jobs , 1997, IEEE Transactions on Aerospace and Electronic Systems.

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

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

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

[21]  Hyoung Joong Kim,et al.  Optimal load distribution for tree network processors , 1996 .

[22]  Maciej Drozdowski,et al.  Scheduling divisible loads in a three-dimensional mesh of processors , 1999, Parallel Comput..