Abstract
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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call