Generic communication in parallel computation

The design of parallel programs requires fancy solutions that are not present in sequential programming. Thus, a designer of parallel applications is concerned with the problem of ensuring the correct behavior of all the processes that the program comprises. There are different solutions to each pro...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Piccoli, María Fabiana, Printista, Alicia Marcela, González, C.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2004
Materias:
Ciencias Informáticas
division function
dynamic polytope
hypercubic communication
programming model
comunicación
Parallel processing
Distributed
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/22485
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-22485
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
division function
dynamic polytope
hypercubic communication
programming model
comunicación
Parallel processing
Distributed
spellingShingle Ciencias Informáticas
division function
dynamic polytope
hypercubic communication
programming model
comunicación
Parallel processing
Distributed
Piccoli, María Fabiana
Printista, Alicia Marcela
González, C.
Generic communication in parallel computation
topic_facet Ciencias Informáticas
division function
dynamic polytope
hypercubic communication
programming model
comunicación
Parallel processing
Distributed
description The design of parallel programs requires fancy solutions that are not present in sequential programming. Thus, a designer of parallel applications is concerned with the problem of ensuring the correct behavior of all the processes that the program comprises. There are different solutions to each problem, but the question is to find one, that is general. One possibility is allowing the use of asynchronous groups of processors. We present a general methodology to derive efficient parallel divide and conquer algorithms. Algorithms belonging to this class allow the arbitrary division of the processor subsets, easing the opportunities of the underlying software to divide the network in independent sub networks, minimizing the impact of the traffic in the rest of the network in the predicted cost. This methodology is defined by OTMP model and its expressiveness is exemplified through three divide and conquer programs.
format Objeto de conferencia
Objeto de conferencia
author Piccoli, María Fabiana
Printista, Alicia Marcela
González, C.
author_facet Piccoli, María Fabiana
Printista, Alicia Marcela
González, C.
author_sort Piccoli, María Fabiana
title Generic communication in parallel computation
title_short Generic communication in parallel computation
title_full Generic communication in parallel computation
title_fullStr Generic communication in parallel computation
title_full_unstemmed Generic communication in parallel computation
title_sort generic communication in parallel computation
publishDate 2004
url http://sedici.unlp.edu.ar/handle/10915/22485
work_keys_str_mv AT piccolimariafabiana genericcommunicationinparallelcomputation
AT printistaaliciamarcela genericcommunicationinparallelcomputation
AT gonzalezc genericcommunicationinparallelcomputation
bdutipo_str Repositorios
_version_ 1764820465794154497

Ejemplares similares