Optimal load allocation for load sharing a divisible job over N processors interconnected in bus-oriented network is considered. The processors are equipped with front-end processors. It is analytically proved, for the first time, that a minimal solution time is achieved when the computation by each processor finishes at the same time. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are also obtained.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Optimal divisible job load sharing for bus networks


    Beteiligte:
    Sohn, J. (Autor:in) / Robertazzi, T.G. (Autor:in)


    Erscheinungsdatum :

    01.01.1996


    Format / Umfang :

    1260551 byte




    Medientyp :

    Aufsatz (Zeitschrift)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Optimal time-varying load sharing for divisible loads

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




    A Scheduling Algorithm with Divisible Load in Wireless Sensor Networks

    Dai, L. / Xu, H. / Chen, T. | British Library Online Contents | 2012