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

Yuichiro Yasui, Katsuki Fujisawa

    研究成果: Chapter in Book/Report/Conference proceedingConference contribution

    15 被引用数 (Scopus)

    抄録

    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).

    本文言語英語
    ホスト出版物のタイトルProceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015
    編集者Vesna Zeljkovic, Waleed W. Smari
    出版社Institute of Electrical and Electronics Engineers Inc.
    ページ377-385
    ページ数9
    ISBN(電子版)9781467378123
    DOI
    出版ステータス出版済み - 9 2 2015
    イベント13th International Conference on High Performance Computing and Simulation, HPCS 2015 - Amsterdam, オランダ
    継続期間: 7 20 20157 24 2015

    出版物シリーズ

    名前Proceedings of the 2015 International Conference on High Performance Computing and Simulation, HPCS 2015

    その他

    その他13th International Conference on High Performance Computing and Simulation, HPCS 2015
    Countryオランダ
    CityAmsterdam
    Period7/20/157/24/15

    All Science Journal Classification (ASJC) codes

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

    フィンガープリント 「Fast and scalable NUMA-based thread parallel breadth-first search」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル