DocumentCode
1913680
Title
Breadth First Search on APEnet+
Author
Bernaschi, Massimo ; Bisson, Mauro ; Mastrostefano, Enrico ; Rossetti, Davide
Author_Institution
Ist. Applicazioni Calcolo, Consiglio Naz. delle Ric., Rome, Italy
fYear
2012
fDate
10-16 Nov. 2012
Firstpage
248
Lastpage
253
Abstract
We present preliminary results of a multi-GPU code for exploring large graphs (hundreds of millions vertices and billions of edges) by using the Breadth First Search algorithm. The GPU hosts are connected by APEnet+, a custom interconnection network that has full support for NVIDIA GPUDirect peer-topeer communication, i.e. the technology allowing a third party device to directly access the GPU memory over the PCI express bus.
Keywords
graph theory; graphics processing units; multiprocessor interconnection networks; peer-to-peer computing; peripheral interfaces; system buses; tree searching; APEnet+; GPU hosts; GPU memory; NVIDIA GPUDirect peer-to-peer communication; PCI express 2012 bus; breadth first search algorithm; custom interconnection network; graphs; multiGPU code; third party device; BFS; CUDA; GPU; P2P; RDMA; graph500; networking;
fLanguage
English
Publisher
ieee
Conference_Titel
High Performance Computing, Networking, Storage and Analysis (SCC), 2012 SC Companion:
Conference_Location
Salt Lake City, UT
Print_ISBN
978-1-4673-6218-4
Type
conf
DOI
10.1109/SC.Companion.2012.41
Filename
6495823
Link To Document