RT info:eu-repo/semantics/bookPart
T1 The All-Pair Shortest-Path Problem in Shared-Memory Heterogeneous Systems
A1 Ortega Arranz, Héctor
A1 Torres de la Sierra, Yuri
A1 Llanos Ferraris, Diego Rafael
A1 González Escribano, Arturo
K1 Informática
K1 1203 Ciencia de Los Ordenadores
K1 3304 Tecnología de Los Ordenadores
AB This chapter faces the All-Pair Shortest-Path problem for sparse graphs combining parallel algorithms and parallel-productivity methods in heterogeneous systems. As this problem can be divided into independent Single-Source ShortestPath subproblems, we distribute this computation space into different processing units, CPUs and graphical processing units (GPUs), that are usually present in modern shared-memory systems. Although the powerful GPUs are significantly faster than the CPUs, its combined use leads to better execution times. Furthermore, two different policies have been used for the scheduling issue, an equitable scheduling, where the workspace is equitably divided between all computational units independently of its nature, and a work-stealing scheduling, where a computational unit steals a new task when it has finished its previous work.
PB Wiley
SN 978-1-118-71205-4
YR 2014
FD 2014
LK https://uvadoc.uva.es/handle/10324/71119
UL https://uvadoc.uva.es/handle/10324/71119
LA eng
NO The All-Pair Shortest-Path Problem in Shared-Memory Heterogeneous Systems. Hector Ortega-Arranz, Yuri Torres, Diego R. Llanos, Arturo González-Escribano. High-Performance Computing on Complex Environments (Book Chapter, ComplexHPC 2013) Series on Parallel and Distributed Computing, Wiley, ISBN 978-1-118-71205-4, pages 283-299
NO Producción Científica
DS UVaDOC
RD 24-nov-2024