Abstract
We present the results obtained by using an evolution of our CUDA-based solution for the exploration, via a breadth first search, of large graphs. This latest version exploits at its best the features of the Kepler architecture and relies on a combination of techniques to reduce both the number of communications among the GPUs and the amount of exchanged data. The final result is a code that can visit more than 800 billion edges in a second by using a cluster equipped with 4,096 Tesla K20X GPUs.
Anno
2016
Autori IAC
Tipo pubblicazione
Altri Autori
Bisson M.; Bernaschi M.; Mastrostefano E.
Editore
Institute of Electrical and Electronics Engineers,
Rivista
IEEE transactions on parallel and distributed systems (Print)
