Abstract
Summary form only given. We propose two methods which employ pipelined communications to distribute divisible loads on tree and pyramid networks. We derive the closed form solutions to the parallel time and speedup for both methods and show that the asymptotic speedup of both methods is 6/spl beta/+1 for a complete b-ary tree network and 4/spl beta/+1 for a pyramid network, where /spl beta/ is the ratio of the time for computing a unit load to the time for communicating a unit load.
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 callDisclaimer: 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.
