Scheduling nonlinear computational loads

A scheduling model for a tree network is studied where the computation time for each node is nonlinear in the size of the assigned load. Optimal load allocation and speedup for simultaneous load distribution for a quadratic nonlinearity are obtained using simple equations. An iterative solution for sequential load distribution is presented for a nonlinearity of arbitrary power. Superlinear speedup is possible when computational complexity is nonlinear in the size of assigned loads. Aerospace applications include spectrum computation, radar and sensor data processing, and satellite image processing.

[1]  Yves Robert,et al.  Scheduling divisible workloads on heterogeneous platforms , 2003, Parallel Comput..

[2]  Thomas G. Robertazzi,et al.  Scalable Scheduling in Parallel Processors , 2002 .

[3]  Maciej Drozdowski,et al.  The combinatorics in divisible load scheduling , 2005 .

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

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

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

[7]  Thomas G. Robertazzi,et al.  Scalable Scheduling for Clusters and Grids Using Cut Through Switching , 2004 .

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

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

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

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

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

[13]  Wlodzimierz Glazek.  A Multistage Load Distribution Strategy for Three-Dimensional Meshes , 2004, Cluster Computing.

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

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

[16]  Pawel Wolniewicz,et al.  Out-of-Core Divisible Load Processing , 2003, IEEE Trans. Parallel Distributed Syst..

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

[18]  Larry Carter,et al.  Bandwidth-centric allocation of independent tasks on heterogeneous platforms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[19]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[20]  Bharadwaj Veeravalli,et al.  Suboptimal solutions using integer approximation techniques for scheduling divisible loads on distributed bus networks , 2000, IEEE Trans. Syst. Man Cybern. Part A.

[21]  Hyoung Joong Kim.  A Novel Optimal Load Distribution Algorithm for Divisible Loads , 2004, Cluster Computing.

[22]  Keqin Li.  Parallel Processing of Divisible Loads on Partitionable Static Interconnection Networks , 2004, Cluster Computing.

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

[24]  Jacek Blazewicz,et al.  Scheduling a Divisible Task in a Two-dimensional Toroidal Mesh , 1999, Discret. Appl. Math..

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

[26]  T.G. Robertazzi,et al.  Switching in sequential tree networks , 2004, IEEE Transactions on Aerospace and Electronic Systems.

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

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

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

[30]  Pawel Wolniewicz,et al.  Optimum divisible load scheduling on heterogeneous stars with limited memory , 2006, Eur. J. Oper. Res..

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

[32]  Thomas G. Robertazzi,et al.  SCALABLE SCHEDULING FOR CLUSTERS AND GRIDS USING CUT THROUGH SWITCHING , 2004 .