Research Abstract:
This paper presents a divisible load scheduling for two-source heterogeneous
single level tree network. Solutions for the optimal finish time and the optimal
load allocation over processors in the network are obtained via linear
programming. We have developed also closed form solutions for the optimal
finish time and the optimal load fractions. The solutions have been derived with
sequential communication strategy. Performance evaluation of a two-source
homogeneous single level tree network with sequential communication is also
presented.