Introducing nested data parallel in barnes hut algorithm

The N-body problem is often characterized by the necessity to interact each of the N bodies with every other one. Its principal problem is the time spent in force computation. Computing the force among a set of N bodies can be done in a straightforward way by computing all N2 pair wise interactions...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Fuentes, M., Piccoli, María Fabiana, Printista, Alicia Marcela
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2002
Materias:
Ciencias Informáticas
comunicación
Parallel
Languages
Algorithms
N-body problems
Parallel programming models
Communication pattern
Data partition
Balanced workload
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23103
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-23103
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
comunicación
Parallel
Languages
Algorithms
N-body problems
Parallel programming models
Communication pattern
Data partition
Balanced workload
spellingShingle Ciencias Informáticas
comunicación
Parallel
Languages
Algorithms
N-body problems
Parallel programming models
Communication pattern
Data partition
Balanced workload
Fuentes, M.
Piccoli, María Fabiana
Printista, Alicia Marcela
Introducing nested data parallel in barnes hut algorithm
topic_facet Ciencias Informáticas
comunicación
Parallel
Languages
Algorithms
N-body problems
Parallel programming models
Communication pattern
Data partition
Balanced workload
description The N-body problem is often characterized by the necessity to interact each of the N bodies with every other one. Its principal problem is the time spent in force computation. Computing the force among a set of N bodies can be done in a straightforward way by computing all N2 pair wise interactions. However, a number of more efficient algorithms have been proposed, these can approximate the forces among N bodies in close to linear time. The Barnes-Hut algorithm is one these. Barnes-Hut algorithm is suitable to be resolve in parallel. Several parallel challenges have been don, most of them for shared memory machine. In this paper, we describe the design of portable and efficient parallel implementation of adaptive N-body method: Barnes-Hut algorithm. Our propose is based on a regular communication pattern and work partitioning scheme that allows to apply nested data parallelism and to obtain portable solution. Finally, our aim is not simply to develop an efficient implementation of one algorithm, but show how a programming model can be applied in problems not suitable to it, in first instance.
format Objeto de conferencia
Objeto de conferencia
author Fuentes, M.
Piccoli, María Fabiana
Printista, Alicia Marcela
author_facet Fuentes, M.
Piccoli, María Fabiana
Printista, Alicia Marcela
author_sort Fuentes, M.
title Introducing nested data parallel in barnes hut algorithm
title_short Introducing nested data parallel in barnes hut algorithm
title_full Introducing nested data parallel in barnes hut algorithm
title_fullStr Introducing nested data parallel in barnes hut algorithm
title_full_unstemmed Introducing nested data parallel in barnes hut algorithm
title_sort introducing nested data parallel in barnes hut algorithm
publishDate 2002
url http://sedici.unlp.edu.ar/handle/10915/23103
work_keys_str_mv AT fuentesm introducingnesteddataparallelinbarneshutalgorithm
AT piccolimariafabiana introducingnesteddataparallelinbarneshutalgorithm
AT printistaaliciamarcela introducingnesteddataparallelinbarneshutalgorithm
bdutipo_str Repositorios
_version_ 1764820468140867584

Ejemplares similares