Abstract
The parallel computing model presented in this paper, the Collective Computing model (CCM), is an improvement of the well-known Bulk Synchronous Parallel (BSP) model. The synchronicity imposed by the BSP model restricts the set of available algorithms and prevents the overlapping of computation and communication. Other models, like the LogP model, allow asynchronous computing and overlapping but depend on the use of specific libraries. The CCM is asynchronous and describes a system exploited through standard software platforms with functions for group a creation and collective operations. Based in the BSP model, two kinds of supersteps are considered: the division and the normal. To illustrate these concepts, the Fast Fourier Transform Algorithm and the Parallel Sorting by Regular Sampling are used. Computational results prove the accuracy of the model in three different parallel computers: a Cray T3E, a Silicon Graphics Origin 2000 and a Digital Alpha Server.
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.
