## Abstract

To date closed form solutions for optimal finish time and job allocation are largely obtained only for network topologies with a single load originating (root) processor. However in large-scale data intensive problems with geographically distributed resources, load is generated from multiple sources. This paper introduces a new divisible load scheduling strategy for single level tree networks with two load originating processors. Solutions for an optimal allocation of fractions of load to nodes in single level tree networks are obtained via linear programming. A unique scheduling strategy that allows one to obtain closed form solutions for the optimal finish time and load allocation for each processor in the network is also presented. The tradeoff between linear programming and closed form solutions in terms of underlying assumptions is examined. Finally, a performance evaluation of a two source homogeneous single level tree network with concurrent communication strategy is presented.

Original language | English (US) |
---|---|

Pages (from-to) | 1081-1092 |

Number of pages | 12 |

Journal | Computers and Mathematics with Applications |

Volume | 58 |

Issue number | 6 |

DOIs | |

State | Published - Sep 2009 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Modeling and Simulation
- Computational Theory and Mathematics
- Computational Mathematics

## Keywords

- Divisible loads
- Grid scheduling
- Multiple sources
- Optimal scheduling
- Tree networks