Fast and scalable NUMA-based thread parallel breadth-first search

Yuichiro Yasui, Katsuki Fujisawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

The breadth-first search (BFS) is one of the most centric kernels in graph processing. Beamer's direction-optimizing BFS algorithm, which selects one of two traversal directions at each level, can reduce unnecessary edge traversals. In a previous paper, we presented an efficient BFS for a non-uniform memory access (NUMA)-based system, in which the NUMA architecture was carefully considered. In this paper, we investigate the locality of memory accesses in terms of the communication with remote memories in a BFS for a NUMA system, and describe a fast and highly scalable implementation. Our new implementation achieves performance rates of 174.704 billion edges per second for a Kronecker graph with 233 vertices and 237 edges on two racks of a SGI UV 2000 system with 1,280 threads. The implementations described in this paper achieved the fastest entries for a shared-memory system in the June 2014 and November 2014 Graph500 lists, and produced the most energy-efficient entries in the second, third, and fourth Green Graph500 lists (big data category).

Original languageEnglish
Title of host publicationProceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages377-385
Number of pages9
ISBN (Electronic)9781467378123
DOIs
Publication statusPublished - Jan 1 2015
Event13th International Conference on High Performance Computing and Simulation, HPCS 2015 - Amsterdam, Netherlands
Duration: Jul 20 2015Jul 24 2015

Other

Other13th International Conference on High Performance Computing and Simulation, HPCS 2015
CountryNetherlands
CityAmsterdam
Period7/20/157/24/15

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Modelling and Simulation

Cite this

Yasui, Y., & Fujisawa, K. (2015). Fast and scalable NUMA-based thread parallel breadth-first search. In Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015 (pp. 377-385). [7237065] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/HPCSim.2015.7237065