M.A. Moges, D. Yu, and T.G. Robertazzi (USA)
Divisible Loads, Scheduling, Tree Networks, Linear Pro
gramming, Multiple Source.
To date solutions for optimal finish time and job alloca
tion in divisible load theory 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 divisi
ble load scheduling strategy for tree networks with two load
originating processors. Solutions for an optimal allocation
of fraction of loads to nodes in single level tree networks
are obtained via linear programming. Performance evalua
tion of a two source homogeneous single level tree network
with concurrent communication strategy is presented.