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.
Divisible Nonlinear Load Distribution on Complete b-Ary Trees
IEEE Transactions on Aerospace and Electronic Systems ; 56 , 2 ; 998-1013
2020-04-01
4825343 byte
Article (Journal)
Electronic Resource
English
Optimal Divisible Job Load Sharing for Bus Networks
Online Contents | 1996
|Optimal time-varying load sharing for divisible loads
IEEE | 1998
|Optimal divisible job load sharing for bus networks
IEEE | 1996
|Optimal Time-Varying Load Sharing for Divisible Loads
Online Contents | 1998
|