Fast and energy-efficient breadth-first search on a single NUMA system

Yuichiro Yasui, Katsuki Fujisawa, Yukinori Sato

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

    17 Citations (Scopus)


    Breadth-first search (BFS) is an important graph analysis kernel. The Graph500 benchmark measures a computer's BFS performance using the traversed edges per second (TEPS) ratio. Our previous nonuniform memory access (NUMA)-optimized BFS reduced memory accesses to remote RAM on a NUMA architecture system; its performance was 11 GTEPS (giga TEPS) on a 4-way Intel Xeon E5-4640 system. Herein, we investigated the computational complexity of the bottom-up, a major bottleneck in NUMA-optimized BFS. We clarify the relationship between vertex out-degree and bottom-up performance. In November 2013, our new implementation achieved a Graph500 benchmark performance of 37.66 GTEPS (fastest for a single node) on an SGI Altix UV1000 (one-rack) and 31.65 GTEPS (fastest for a single server) on a 4-way Intel Xeon E5-4650 system. Furthermore, we achieved the highest Green Graph500 performance of 153.17 MTEPS/W (mega TEPS per watt) on an Xperia-A SO-04E with a Qualcomm Snapdragon S4 Pro APQ8064.

    Original languageEnglish
    Title of host publicationSupercomputing - 29th International Conference, ISC 2014, Proceedings
    PublisherSpringer Verlag
    Number of pages17
    ISBN (Print)9783319075174, 9783319075174
    Publication statusPublished - 2014
    Event29th International Supercomputing Conference, ISC 2014 - Leipzig, Germany
    Duration: Jun 22 2014Jun 26 2014

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8488 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349


    Other29th International Supercomputing Conference, ISC 2014

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)


    Dive into the research topics of 'Fast and energy-efficient breadth-first search on a single NUMA system'. Together they form a unique fingerprint.

    Cite this