Skip to main content
SpringerLink
Log in

Fast, Scalable, and Energy-Efficient Parallel Breadth-First Search

  • Conference paper
  • First Online:
The Role and Importance of Mathematics in Innovation

Part of the book series: Mathematics for Industry ((MFI,volume 25))

Abstract

The breadth-first search (BFS) is one of the most centric processing in graph theory. In this paper, we presented a fast, scalable, and energy-efficient BFS for a nonuniform memory access (NUMA)-based system, in which the NUMA architecture was carefully considered. Our implementation achieved performance rates of 175 billion edges per second for Kronecker graph with \(2^{33}\) vertices and \(2^{37}\) edges on two racks of a SGI UV 2000 system with 1,280 threads and the fastest entries for a shared-memory system in the June 2014 and November 2014 Graph500 lists. It also produced the most energy-efficient entries in the first and second (small data category) and third, fourth, fifth, and sixth (big data category) Green Graph500 lists on a 4-socket Intel Xeon E5-4640 system.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Graph500 benchmark: http://www.graph500.org.

  2. 2.

    Green Graph500 benchmark: http://green.graph500.org.

References

  1. Agarwal, V., Petrini, F., Pasetto, D., Bader, D.A.: Scalable graph exploration on multicore processors. In: Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis (SC10), IEEE Computer Society (2010)

    Google Scholar 

  2. Beamer, S., Asanovć, K., Patterson, D.A.: Direction-optimizing breadth-first search. In: Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis (SC12), IEEE Computer Society, p 12 (2012)

    Google Scholar 

  3. Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociol. 25(2), 163–177 (2001)

    Article  MATH  Google Scholar 

  4. Broquedis, F., Clet-Ortega, J., Moreaud, S., Furmento, N., Goglin, B., Mercier, G., Thibault, S., Namyst, R.: hwloc: a generic framework for managing hardware affinities in HPC applications. In: Proceedings of the 18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP2010) (2010)

    Google Scholar 

  5. Cormen, T., Leiserson, C., Rivest, R.: Introduction To Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  6. Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Sov. Math. Dokl. 11, 1277–1280 (1970)

    Google Scholar 

  7. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM 19(2), 248–264 (1972)

    Article  MATH  Google Scholar 

  8. Frasca, M., Madduri, K., Raghavan, P.: NUMA-aware graph mining techniques for performance and energy efficiency. In: Proceedings of the ACM/IEEE International Conference on High Performance Computing, Networking, Storage and Analysis (SC12), IEEE Computer Society (2012)

    Google Scholar 

  9. Fujisawa, K., Endo, T., Yasui, Y., Sato, H., Matsuzawa, N., Matsuoka, S., Waki, H.: Petascale general solver for semidefinite programming problems with over two million constraints. In: Proceedings of the IEEE International Symposium on Parallel and Distributed Processing (IPDPS 14), IEEE Computer Society (2014)

    Google Scholar 

  10. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821–7826 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hoefler, T.: GreenGraph500 Submission Rules. http://green.graph500.org/greengraph500rules.pdf

  12. Huang, L., Jin, H., Yi, L., Chapman, B.: Enabling locality-aware computations in OpenMP. Exploring Languages for Expressing Medium to Massive On-Chip Parallelism archive J. Sci. Program. 18(3–4), 169–181 (2010)

    Google Scholar 

  13. Intel(R) C++ Compiler XE 13.1 User and Reference Guide, Intel Thread Affinity Interface

    Google Scholar 

  14. Iwabuchi, K., Sato, H., Yasui, Y., Fujisawa, K.: Hybrid BFS approach using semi-external memory. In: Proceedings of the International Workshop on High Performance Data Intensive Computing (HPDIC2014) (2014)

    Google Scholar 

  15. Iwabuchi, K., Sato, H., Yasui, Y., Fujisawa, K., Matsuoka, S.: NVM-based hybrid BFS with memory efficient data structure. In: Proceedings of the IEEE International Conference on BigData, IEEE Computer Society (2014)

    Google Scholar 

  16. Leskovec, J., Chakrabarti, D., Kleinberg, J., Faloutsos, C., Ghahramani, Z.: Kronecker graphs: An approach to modeling networks. J. Mach. Learning Res. 11, 985–1042 (2010)

    MathSciNet  MATH  Google Scholar 

  17. Murphy, R.C., Wheeler, K.B., Barrett, B.W., Ang, J.A.: Introducing the Graph500, In: Proceedings of the Cray User Group (2010)

    Google Scholar 

  18. Treibig, J., Hager, G., Wellein, G.: LIKWID: A lightweight performance-oriented tool suite for x86 multicore environments. PSTI2010 (2010)

    Google Scholar 

  19. Ueno, K., Suzumura, T.: Highly scalable graph search for the Graph500 Benchmark. In: Proceedings of the 21st International ACM Symposium on High-Performance Parallel and Distributed Computing (HPDC’12), pp. 149–160, ACM (2012)

    Google Scholar 

  20. Yasui, Y., Fujisawa, K., Goto, K., Kamiyama, N., Takamatsu, M.: NETAL: High-performance implementation of network analysis library considering computer memory hierarchy. J. Oper. Res. Soc. Japan 54(4), 259–280 (2011)

    MathSciNet  MATH  Google Scholar 

  21. Yasui, Y., Fujisawa, K., Goto., K.: NUMA-optimized parallel breadth-first search on multicore single-node system. In: Proceedings of the IEEE International Conference on BigData, IEEE Computer Society (2013)

    Google Scholar 

  22. Yasui, Y., Fujisawa, K., Sato, Y.: Fast and energy-efficient breadth-first search on a single NUMA system. In: Kunkel, J.M., Ludwig, T., Meuer, H. (eds.) Supercomputing, Lecture Notes in Computer Science. vol. 8488, pp. 365–381. Springer, Berlin (2014)

    Google Scholar 

  23. Yasui, Y., Fujisawa, K.: Fast and scalable NUMA-based thread parallel breadth-first search. In: Proceedings of the HPCS 2015 (The 2015 International Conference on High Performance Computing & Simulation), ACM, IEEE, IFIP, Amsterdam, the Netherlands (2015)

    Google Scholar 

Download references

Acknowledgments

This research was supported by the Core Research for Evolutional Science and Technology (CREST) and the Center of Innovation (COI) programs of the Japan Science and Technology Agency (JST), the Institute of Statistical Mathematics (ISM), and Silicon Graphics International (SGI) Corp.

Author information

Authors and Affiliations

  1. Center for Co-evolutional Social Systems, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka, 819-0395, Japan

    Yuichiro Yasui

  2. Institute of Mathematics for Industry, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka, 819-0395, Japan

    Katsuki Fujisawa

Authors
  1. Yuichiro Yasui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Katsuki Fujisawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuichiro Yasui .

Editor information

Editors and Affiliations

  1. Informatics and Statistics, CSIRO Mathematics Informatics and Statistics, Canberra, Aust Capital Terr, Australia

    Bob Anderssen

  2. Mathematics & Statistics Dept, La Trobe Univ Mathematics & Statistics Dept, Bundoora, Victoria, Australia

    Philip Broadbridge

  3. Inst of Math for Industry, Kyushu University Inst of Math for Industry, Fukuoka, Fukuoka, Japan

    Yasuhide Fukumoto

  4. Inst of Math for Industry, Kyushu University, Fukuoka, Japan

    Naoyuki Kamiyama

  5. Inst of Math for Industry, Kyushu University Inst of Math for Industry, Fukuoka, Japan

    Yoshihiro Mizoguchi

  6. AG Mathematical Geometry Processing, Freie Univ Berlin AG Mathematical Geometry Processing, Berlin, Germany

    Konrad Polthier

  7. Inst of Math for Industry, Kyushu University Inst of Math for Industry, Fukuoka, Japan

    Osamu Saeki

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Science+Business Media Singapore

About this paper

Cite this paper

Yasui, Y., Fujisawa, K. (2017). Fast, Scalable, and Energy-Efficient Parallel Breadth-First Search. In: Anderssen, B., et al. The Role and Importance of Mathematics in Innovation. Mathematics for Industry, vol 25. Springer, Singapore. https://doi.org/10.1007/978-981-10-0962-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-0962-4_6

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-0961-7

  • Online ISBN: 978-981-10-0962-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation