The collective computing model

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