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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Optimal divisible job load sharing for bus networks


    Contributors:
    Sohn, J. (author) / Robertazzi, T.G. (author)


    Publication date :

    1996-01-01


    Size :

    1260551 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    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