Abstract
Valiant proposed the Bulk Synchronous Parallel (BSP) model as a possible model for parallel computing. He refers to BSP as a bridging model, being applicable to both system and algorithm design. The model allows hardware and software design to proceed independently but ensures compatibility between parallel computers and parallel programs. This paper explores the practical use of BSP, focusing on the portability and predictability it offers, without incurring any significant loss in efficiency. A BSP algorithm for sorting proposed by Gerbessiotis and Valiant is implemented in a portable fashion on three different parallel computers, specifically an Intel iPSC/860, a Transtech Parastation and an Alex AVX Series 2. The program uses a standard library of functions designed and implemented for each machine to support the BSP model. The measured performance of the program is compared to the BSP predictions and to other sorting results on similar machines to provide evidence for the utility of the BSP model.
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.
