Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Divide-and-conquer algorithms on two-dimensional meshes

Autor
Valero-Garcia, M; Gonzalez, A.; Diaz De Cerio, L.; Royo, M.D.
Tipus d'activitat
Article en revista
Revista
Lecture notes in computer science
Data de publicació
1998-09
Volum
1470
Pàgina inicial
1051
Pàgina final
1056
DOI
https://doi.org/10.1007/BFb0057966 Obrir en finestra nova
URL
http://link.springer.com/chapter/10.1007/BFb0057966 Obrir en finestra nova
Resum
The Reflecting and Growing mappings have been proposed to map parallel divide-and-conquer algorithms onto two — dimensional meshes. The performance of these mappings has been previously analyzed under the assumption that the parallel algorithm is initiated always at the same fixed node of the mesh. In such scenario, the Reflecting mapping is optimal for meshes with wormhole routing and the Growing mapping is very close to the optimal for meshes with store-and-forward routing. In this paper we ...
Grup de recerca
ARCO - Microarquitectura i Compiladors
CAP - Grup de Computació d'Altes Prestacions

Participants