1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DC2024★ 1 cited
Enhanced OpenMP Algorithm to Compute All-Pairs Shortest Path on x86 Architectures
Sergio Calderón, Enzo Rucci, Franco Chichizola
Graphs have become a key tool when modeling and solving problems in different areas. The Floyd-Warshall (FW) algorithm computes the shortest path between all pairs of vertices in a…
cs.DC2021★ 1 cited
Comparison of HPC Architectures for Computing All-Pairs Shortest Paths. Intel Xeon Phi KNL vs NVIDIA Pascal
Manuel Costanzo, Enzo Rucci, Ulises Costi +2
Today, one of the main challenges for high-performance computing systems is to improve their performance by keeping energy consumption at acceptable levels. In this context, a cons…