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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Scheduling divisible loads with nonlinear communication time


    Beteiligte:
    Kai Wang (Autor:in) / Robertazzi, Thomas G. (Autor:in)


    Erscheinungsdatum :

    01.07.2015


    Format / Umfang :

    510813 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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


    Scheduling Nonlinear Computational Loads

    Hung, J.T. | Online Contents | 2008