Divisible Load Scheduling For Two Source Single Level Tree Networks

Manar's picture
Published at: 
The Proceedings of 8th International Conference on Engineering and Technology Research 24 - 25 April 2014, Novotel World Trade Centre, Dubai, UAE, ISBN: 978-1-922069-49-8
Year: 
2014
AttachmentSize
1398853478_622-sameer (1).pdf500.16 KB
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.