Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Aerospace and Electronic Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
