Abstract
Since many distributed-memory machines rely only on point-to-point com- munication between processors, various broadcast operations must be created using this type of primitive. In this paper we consider the fundamental problem of broadcastingk-items from one processor to all the remaining processors on a parallel machine. Using point-to-point communication and the LogP model, we design an algorithm fork-item broadcast whose running time is within an additive constant of the lower bound. We also present an optimal algorithm fork-item broadcast on a variant of LogP.
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 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.
