A scheduling model for single level tree networks with various distribution policies is studied in which the communication time from the root to each node is nonlinear in the size of the load. An iterative method is implemented to solve the optimal load distribution. The difference between sublinear and superlinear complexity is examined, where many applications arise in the aerospace field.
Scheduling divisible loads with nonlinear communication time
IEEE Transactions on Aerospace and Electronic Systems ; 51 , 3 ; 2479-2485
01.07.2015
510813 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Scheduling divisible loads on hypercubes in one port communication model
British Library Conference Proceedings | 1998
|Optimal time-varying load sharing for divisible loads
IEEE | 1998
|Optimal Time-Varying Load Sharing for Divisible Loads
Online Contents | 1998
|British Library Online Contents | 2018
|Scheduling nonlinear computational loads
IEEE | 2008
|