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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Scheduling divisible loads with nonlinear communication time


    Contributors:


    Publication date :

    2015-07-01


    Size :

    510813 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Scheduling divisible loads on hypercubes in one port communication model

    Glazek, W. | British Library Conference Proceedings | 1998


    Optimal time-varying load sharing for divisible loads

    Sohn, J. / Robertazzi, T.G. | IEEE | 1998



    A Periodical Multi-Installment Scheduling Model and Algorithm for Divisible Loads in Distributed Computing Systems

    Zhu, Hai / Wang, Xiaoli / Ma, Haiming | British Library Online Contents | 2018


    An Optimization Model for Divisible-Load Scheduling Considering Processor Time-Window

    Lai, Junfan / Wang, Yuping / Wang, Xiaoli | British Library Online Contents | 2017