This paper investigates the problem of a divisible nonlinear load distribution on homogeneous complete b-ary tree networks. Classic models of nonlinear computational loads omit several steps in processing the load and yield only an approximate distribution for fractional loads. This paper considers a new model of nonlinear computational loads that includes all load processing steps and yields a practical solution to distribute fractional loads. Two algorithms to distribute a divisible nonlinear load on homogeneous complete b-ary tree networks are proposed. Closed-form expressions for the parallel processing time and speed-up for complete b-ary trees are also derived. This paper demonstrates that the asymptotic speed-up of the proposed algorithms is the number of processors in a multicomputer system. The proposed algorithms improved the classic algorithm in terms of speed-up.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Divisible Nonlinear Load Distribution on Complete b-Ary Trees


    Contributors:


    Publication date :

    2020-04-01


    Size :

    4825343 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Divisible Nonlinear Load Distribution on Heterogeneous Single-Level Trees

    Chen, Chi-Yeh / Chu, Chih-Ping | IEEE | 2018

    Free access


    Optimal time-varying load sharing for divisible loads

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


    Optimal divisible job load sharing for bus networks

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