Kyushu University Academic Staff Educational and Research Activities Database
Researcher information (To researchers) Need Help? How to update
Katsuki Fujisawa Last modified date:2019.07.01





E-Mail
Homepage
http://opt.imi.kyushu-u.ac.jp/lab/en/index.html
The Web page of Fujisawa Laboratory .
http://opt.imi.kyushu-u.ac.jp/graphcrest/eng/
JST CREST : Graph CREST Project HP .
http://opt.imi.kyushu-u.ac.jp/~fujisawa/
Katsuki Fujisawa: Personal HP .
Phone
092-802-4402
Fax
092-802-4405
Academic Degree
Ph.D. Sc.
Country of degree conferring institution (Overseas)
No
Field of Specialization
Mathematical Optimization, Graph Analysis, High Performance Computing, Data Science
Total Priod of education and research career in the foreign country
00years00months
Outline Activities
The objective of our ongoing research project is to develop an advanced computing and optimization infrastructure for extremely large-scale graphs on post peta-scale supercomputers. Recent emergence of extremely large-scale graphs in various application fields, such as transportation, social network, cyber-security, and bioinformatics, etc., requires fast and scalable analysis. We propose a new framework of software stacks for extremely large-scale graph analysis systems, such as parallel graph analysis and optimization libraries on multiple CPUs and GPUs, hierarchal graph stores using non-volatile memory (NVM) devices, and graph processing and visualization systems.
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). In 2014 and 2018, our project team was a winner of the eighth, 10th, and 17th Graph500 and the 3rd to 6th Green Graph500 benchmarks, respectively.
We also present our parallel implementation for large-scale mathematical optimization problems. In the last decade, mathematical optimization programming (MOP) problems have been intensively studied in both their theoretical and practical aspect in a wide range of fields, such as combinatorial optimization, structural optimization, control theory, economics, quantum chemistry, sensor network location, data mining, and machine learning. The semidefinite programming (SDP) problem is a predominant problem in mathematical optimization. We demonstrate that our implementation is a high-performance general solver for SDPs in various application fields through numerical experiments at the TSUBAME 2.5 supercomputer in the Tokyo Institute of Technology, and we solved the largest SDP problem, thereby creating a new world record.
Research
Research Interests
  • Industrial Application Development in Cyber Physical
    keyword : CPS, AI, BigData, HPC
    2019.04~2022.03.
  • Infrastructure for Extremely Large-Scale Graphs on Post Peta-Scale Supercomputers
    keyword : Mathematical Optimization, Graph Analysis, High Performance Computing
    2011.10~2020.03.
  • Graph Analysis and High Performance Computing Techniques for Realizing Urban OS
    keyword : Urban OS
    2015.09~2020.03.
  • High Performance Computing for Mathematical Optimization Problems
    keyword : Optimization Problem
    1995.04~2020.03.
  • A Challenge to Graph 500 and Green Graph 500 benchmarks
    keyword : High Performance Computing
    2015.09~2020.03.
  • Development of High Performance Graph Search and Optimization Library for Graph Analysis
    keyword : Graph Analysis
    2015.09~2020.03.
Current and Past Project
  • We present our ongoing research project that is supported by the Japan Science and Technology Agency (JST), the Core Research of Evolutionary Science and Technology (CREST). The objective of this project is to develop an ad- vanced computing and optimization infrastructure 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. Following its announcement in June 2010, the Graph500 list was released in November 2010. The list has been updated biannually ever since. The Graph500 benchmark mea- sures 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 Tech- nology in 2012. The Green Graph 500 list collects TEPS-per-watt metrics. In ISC14, 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 im- plementation 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.
Academic Activities
Awards
  • The Eighth Graph 500 list and the Third Green Graph 500 list were announced at the 2014 International Supercomputing Conference (ISC'14) in Leipzig, Germany. We won the first positions in the world ranking of both the Graph500 Benchmark and the Green Graph500 Benchmark. These results show that our algorithm and implementation is suitable for big data computation in several computing environments, such as distributed-memory supercomputers, shared-memory supercomputers, Intel/AMD servers, and Android devices.
    http://www.graphcrest.jp/eng/news2014-06.html
Educational
Educational Activities
Classes and education activities in the Graduate School of Mathematics, the Faculty of Mathematics
Classes activities in the Faculty of Engineering
Social
Professional and Outreach Activities
Research collaboration with ZIB (Zuse Institute Berlin, the German State Institute of Berlin). We hold personnel exchanges and international workshops every year..