Skip to main content
SpringerLink
Log in

Advanced Computing and Optimization Infrastructure for Extremely Large-Scale Graphs on Post Peta-Scale Supercomputers

  • Conference paper
  • First Online:
Optimization in the Real World

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

Abstract

In this paper, we present our ongoing research project. The objective of this project is to develop advanced computing and optimization infrastructures for extremely large-scale graphs on post peta-scale supercomputers. We explain our challenge to Graph 500 and Green Graph 500 benchmarks that are designed to measure the performance of a computer system for applications that require irregular memory and network access patterns. The 1st Graph500 list was released in November 2010. The Graph500 benchmark measures the performance of any supercomputer performing a BFS (Breadth-First Search) in terms of traversed edges per second (TEPS). We have implemented world’s first GPU-based BFS on the TSUBAME 2.0 supercomputer at Tokyo Institute of Technology in 2012. The Green Graph 500 list collects TEPS-per-watt metrics. In 2014, our project team was a winner of the 8th Graph500 benchmark and 3rd Green Graph 500 benchmark. We also present our parallel implementation for large-scale SDP (SemiDefinite Programming) problem. We solved the largest SDP problem (which has over 2.33 million constraints), thereby creating a new world record. Our implementation also achieved 1.713 PFlops in double precision for large-scale Cholesky factorization using 2,720 CPUs and 4,080 GPUs on the TSUBAME 2.5 supercomputer.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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.

    http://www.graphcrest.jp/eng/.

  2. 2.

    http://www.graph500.org.

  3. 3.

    http://green.graph500.org.

  4. 4.

    http://www.graphcrest.jp/eng/.

  5. 5.

    http://coi.kyushu-u.ac.jp/en/.

References

  1. Beamer, S., Asanović, K., Patterson, D.A.: Searching for a parent instead of fighting over children: a fast breadth-first search implementation for Graph500. Berkeley, CA: EECS Department, University of California, UCB/EECS-2011-117 (2011)

    Google Scholar 

  2. Beamer, S., Asanović, 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 (2012)

    Google Scholar 

  3. Fujisawa, K., Endo, T., Sato, H., Yamashita, M., Matsuoka, S., Nakata, M.: High-performance general solver for extremely large-scale semidefinite programming problems. In: Proceedings of the 2012 ACM/IEEE Conference on Supercomputing, SC’12 (2012)

    Google Scholar 

  4. Fujisawa, K., Endo, T., Sato, H., Yasui, Y., Matsuzawa, N., Waki, H.: Peta-scale general solver for semidefinite programming problems with over two million constraints, SC13 regular, electronic, and educational poster. In: International Conference for High Performance Computing, Networking, Storage and Analysis 2013 (SC2013) (2013)

    Google Scholar 

  5. Fujisawa, K., Endo, T., Yasui, Y., Sato, H., Matsuzawa, N., Matsuoka, S., Waki, H.: Peta-scale general solver for semidefinite programming problems with over two million constraints. In: The 28th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2014) (2014)

    Google Scholar 

  6. Iwabuchi, K., Sato, H., Mizote, R., Yasui, Y., Fujisawa, K., Matsuoka, S.: Hybrid BFS approach using semi-external memory. In: International Workshop on High Performance Data Intensive Computing (HPDIC2014) in Conjunction with IEEE IPDPS 2014 (2014)

    Google Scholar 

  7. Iwabuchi, K., Sato, H., Yasui, Y., Fujisawa, K., Matsuoka, S.: NVM-based hybrid BFS with memory efficient data structure. In: The proceedings of the IEEE BigData2014 (2014)

    Google Scholar 

  8. Iwabuchi, K., Sato, H., Yasui, Y., Fujisawa, K.: Performance analysis of hybrid BFS approach using semi-external memory, SC 2013 regular, electronic, and educational poster. In: International Conference for High Performance Computing, Networking, Storage and Analysis (SC2013) (2013)

    Google Scholar 

  9. Koch, T., Martin, A., Pfetsch, M.E.: Progress in Academic Computational Integer Programming, Facets of Combinatorial Optimization—Festschrift for Martin Grötschel, pp. 483–506. Springer (2013)

    Google Scholar 

  10. Koch, T., Ralphs, T., Shinano, Y.: Could we use a millon cores to solve an integer program? Math. Methods Oper. Res. 76, 67–93 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  11. Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T.: ParaSCIP: a parallel extension of SCIP. In: Competence in High Performance Computing 2010, pp. 135–148. Springer (2012)

    Google Scholar 

  12. Suzumura, T., Ueno, K., Sato, H., Fujisawa, K., Matsuoka, S.: A performance characteristics of Graph500 on large-scale distributed environment. In: The proceedings of the 2011 IEEE International Symposium on Workload Characterization (2011)

    Google Scholar 

  13. Ueno, K., Suzumura, T.: Highly scalable graph search for the Graph500 benchmark. In: HPDC 2012 (The 21st International ACM Symposium on High-Performance Parallel and Distributed Computing), Delft, Netherlands (2012)

    Google Scholar 

  14. Yamashita, M., Fujisawa, K., Fukuda, M., Kobayashi, K., Nakata, K., Nakata, M.: Latest developments in the SDPA family for solving large-scale SDPs. In: Anjos, M.F., Lasserre, J.B. (eds.), Handbook on Semidefinite, Conic and Polynomial Optimization, International Series in Operations Research & Management Science, Chapter 24 (2011)

    Google Scholar 

  15. Yamashita, M., Fujisawa, K., Fukuda, M., Nakata, K., Nakata, M.: Parallel solver for semidefinite programming problem having sparse Schur complement matrix. In: ACM Transactions on Mathematical Software, vol. 39, Number 12 (2012)

    Google Scholar 

  16. Yasui, Y., Fujisawa, K., Goto, K.: NUMA-optimized parallel breadth-first search on multicore single-node system. In: The Proceedings of the IEEE BigData2013 (2013)

    Google Scholar 

  17. 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. Jpn. 54(4), 259280 (2011)

    MathSciNet  Google Scholar 

  18. Yasui, Y., Fujisawa, K., Sato, Y.: Fast and energy-efficient breadth-first search on a single NUMA system. In: Intentional Supercomputing Conference (ISC 14) (2014)

    Google Scholar 

Download references

Acknowledgments

This research project was supported by the Japan Science and Technology Agency (JST), the Core Research of Evolutionary Science and Technology (CREST), the Center of Innovation Science and Technology based Radical Innovation and Entrepreneurship Program (COI Program), and the TSUBAME 2.0 & 2.5 Supercomputer Grand Challenge Program at the Tokyo Institute of Technology.

Author information

Authors and Affiliations

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

    Katsuki Fujisawa & Yuichiro Yasui

  2. University College Dublin, Belfield, Dublin, 4, Ireland

    Toyotaro Suzumura

  3. Global Scientific Information and Computing Center, Tokyo Institute of Technology, 2-12-1 O-okayama, Meguroku, Tokyo, 152-8550, Japan

    Hitoshi Sato & Toshio Endo

  4. Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, 2-12-1 O-okayama, Meguroku, Tokyo, 152-8550, Japan

    Koji Ueno & Keita Iwabuchi

Authors
  1. Katsuki Fujisawa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Toyotaro Suzumura
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hitoshi Sato
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Koji Ueno
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yuichiro Yasui
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Keita Iwabuchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Toshio Endo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Katsuki Fujisawa .

Editor information

Editors and Affiliations

  1. Kyushu University, Fukuoka, Japan

    Katsuki Fujisawa

  2. Zuse Institute Berlin, Berlin, Germany

    Yuji Shinano

  3. Kyushu University, Fukuoka, Japan

    Hayato Waki

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Japan

About this paper

Cite this paper

Fujisawa, K. et al. (2016). Advanced Computing and Optimization Infrastructure for Extremely Large-Scale Graphs on Post Peta-Scale Supercomputers. In: Fujisawa, K., Shinano, Y., Waki, H. (eds) Optimization in the Real World. Mathematics for Industry, vol 13. Springer, Tokyo. https://doi.org/10.1007/978-4-431-55420-2_1

Download citation

  • DOI: https://doi.org/10.1007/978-4-431-55420-2_1

  • Published:

  • Publisher Name: Springer, Tokyo

  • Print ISBN: 978-4-431-55419-6

  • Online ISBN: 978-4-431-55420-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation