Collective computing

The parallel computing model used in this paper, the Collective Computing Model (CCM), is a variant 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 communicat...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Gonzalez, Jesús Alberto, León, Coromoto, Piccoli, María Fabiana, Printista, Alicia Marcela, Roda García, José Luis, Rodriguez, C., Sande, Francisco de
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2001
Materias:
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23541
Aporte de:
id I19-R120-10915-23541
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Parallel
Real time
Distributed
Bulk Synchronous Parallel Model
Supersteps
Performance Prediction
Parallel Computer
spellingShingle Ciencias Informáticas
Parallel
Real time
Distributed
Bulk Synchronous Parallel Model
Supersteps
Performance Prediction
Parallel Computer
Gonzalez, Jesús Alberto
León, Coromoto
Piccoli, María Fabiana
Printista, Alicia Marcela
Roda García, José Luis
Rodriguez, C.
Sande, Francisco de
Collective computing
topic_facet Ciencias Informáticas
Parallel
Real time
Distributed
Bulk Synchronous Parallel Model
Supersteps
Performance Prediction
Parallel Computer
description The parallel computing model used in this paper, the Collective Computing Model (CCM), is a variant 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 describes a system exploited through a standard software platform providing facilities for group creation, collective operations and remote memory operations. Based in the BSP model, two kinds of supersteps are considered: division supersteps and normal supersteps. To illustrate these concepts, the Fast Fourier Transform Algorithm is used. Computational results prove the accuracy of the model in four different parallel computers: a Parsytec Power PC, a Cray T3E, a Silicon Graphics Origin 2000 and a Digital Alpha Server.
format Objeto de conferencia
Objeto de conferencia
author Gonzalez, Jesús Alberto
León, Coromoto
Piccoli, María Fabiana
Printista, Alicia Marcela
Roda García, José Luis
Rodriguez, C.
Sande, Francisco de
author_facet Gonzalez, Jesús Alberto
León, Coromoto
Piccoli, María Fabiana
Printista, Alicia Marcela
Roda García, José Luis
Rodriguez, C.
Sande, Francisco de
author_sort Gonzalez, Jesús Alberto
title Collective computing
title_short Collective computing
title_full Collective computing
title_fullStr Collective computing
title_full_unstemmed Collective computing
title_sort collective computing
publishDate 2001
url http://sedici.unlp.edu.ar/handle/10915/23541
work_keys_str_mv AT gonzalezjesusalberto collectivecomputing
AT leoncoromoto collectivecomputing
AT piccolimariafabiana collectivecomputing
AT printistaaliciamarcela collectivecomputing
AT rodagarciajoseluis collectivecomputing
AT rodriguezc collectivecomputing
AT sandefranciscode collectivecomputing
bdutipo_str Repositorios
_version_ 1764820465776328704