Loading...
Loading...

Go to the content (press return)

Task-based parallel breadth-first search in heterogeneous environments

Author
Munguía, L. M.; Bader , D.; Ayguade, E.
Type of activity
Presentation of work at congresses
Name of edition
HiPC - 19th International Conference on High Performance Computing
Date of publication
2013
Presentation's date
2012-12
Book of congress proceedings
19th International Conference on High Performance Computing
First page
1
Last page
10
DOI
https://doi.org/10.1109/HiPC.2012.6507474 Open in new window
Repository
http://hdl.handle.net/2117/18360 Open in new window
URL
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6507474 Open in new window
Abstract
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...
Citation
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.
Group of research
CAP - High Performace Computing Group

Participants

  • Munguía, Lluis Miquel  (author and speaker )
  • Bader, David A.  (author and speaker )
  • Ayguade Parra, Eduard  (author and speaker )