Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Task-based parallel breadth-first search in heterogeneous environments

Autor
Munguía, L. M.; Bader , D.; Ayguade, E.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
HiPC - 19th International Conference on High Performance Computing
Any de l'edició
2013
Data de presentació
2012-12
Llibre d'actes
19th International Conference on High Performance Computing
Pàgina inicial
1
Pàgina final
10
DOI
https://doi.org/10.1109/HiPC.2012.6507474 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/18360 Obrir en finestra nova
URL
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6507474 Obrir en finestra nova
Resum
Breadth-first search (BFS) is an essential graph traversal strategy widely used in many computing applications. Because of its irregular data access patterns, BFS has become a non-trivial problem hard to parallelize efficiently. In this paper, we introduce a parallelization strategy that allows the load balancing of computation resources as well as the execution of graph traversals in hybrid environments composed of CPUs and GPUs. To achieve that goal, we use a fine-grained task-based paralleliz...
Citació
Munguía, L. M.; Bader , D.; Ayguade, E. Task-based parallel breadth-first search in heterogeneous environments. A: International Conference on High Performance Computing. "19th International Conference on High Performance Computing". Pune: 2013, p. 1-10.
Grup de recerca
CAP - Grup de Computació d'Altes Prestacions

Participants

  • Munguía, Lluis Miquel  (autor ponent)
  • Bader, David A.  (autor ponent)
  • Ayguade Parra, Eduard  (autor ponent)