Petascale general solver for semidefinite programming problems with over two million constraints

Katsuki Fujisawa, Toshio Endo, Yuichiro Yasui, Hitoshi Sato, Naoki Matsuzawa, Satoshi Matsuoka, Hayato Waki

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

11 Citations (Scopus)

Abstract

The semi definite programming (SDP) problem is one of the central problems in mathematical optimization. The primal-dual interior-point method (PDIPM) is one of the most powerful algorithms for solving SDP problems, and many research groups have employed it for developing software packages. However, two well-known major bottlenecks, i.e., the generation of the Schur complement matrix (SCM) and its Cholesky factorization, exist in the algorithmic framework of the PDIPM. We have developed a new version of the semi definite programming algorithm parallel version (SDPARA), which is a parallel implementation on multiple CPUs and GPUs for solving extremely large-scale SDP problems with over a million constraints. SDPARA can automatically extract the unique characteristics from an SDP problem and identify the bottleneck. When the generation of the SCM becomes a bottleneck, SDPARA can attain high scalability using a large quantity of CPU cores and some processor affinity and memory interleaving techniques. SDPARA can also perform parallel Cholesky factorization using thousands of GPUs and techniques for overlapping computation and communication if an SDP problem has over two million constraints and Cholesky factorization constitutes a bottleneck. We demonstrate that SDPARA is a high-performance general solver for SDPs in various application fields through numerical experiments conducted on the TSUBAME 2.5 supercomputer, and 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.

Original languageEnglish
Title of host publicationProceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014
PublisherIEEE Computer Society
Pages1171-1180
Number of pages10
ISBN (Print)9780769552071
DOIs
Publication statusPublished - Jan 1 2014
Event28th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2014 - Phoenix, AZ, United States
Duration: May 19 2014May 23 2014

Publication series

NameProceedings of the International Parallel and Distributed Processing Symposium, IPDPS
ISSN (Print)1530-2075
ISSN (Electronic)2332-1237

Other

Other28th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2014
CountryUnited States
CityPhoenix, AZ
Period5/19/145/23/14

Fingerprint

Computer programming
Parallel algorithms
Factorization
Program processors
Supercomputers
Software packages
Scalability
Data storage equipment
Communication
Graphics processing unit
Experiments

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Fujisawa, K., Endo, T., Yasui, Y., Sato, H., Matsuzawa, N., Matsuoka, S., & Waki, H. (2014). Petascale general solver for semidefinite programming problems with over two million constraints. In Proceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014 (pp. 1171-1180). [6877345] (Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS). IEEE Computer Society. https://doi.org/10.1109/IPDPS.2014.121

Petascale general solver for semidefinite programming problems with over two million constraints. / Fujisawa, Katsuki; Endo, Toshio; Yasui, Yuichiro; Sato, Hitoshi; Matsuzawa, Naoki; Matsuoka, Satoshi; Waki, Hayato.

Proceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014. IEEE Computer Society, 2014. p. 1171-1180 6877345 (Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS).

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

Fujisawa, K, Endo, T, Yasui, Y, Sato, H, Matsuzawa, N, Matsuoka, S & Waki, H 2014, Petascale general solver for semidefinite programming problems with over two million constraints. in Proceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014., 6877345, Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS, IEEE Computer Society, pp. 1171-1180, 28th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2014, Phoenix, AZ, United States, 5/19/14. https://doi.org/10.1109/IPDPS.2014.121
Fujisawa K, Endo T, Yasui Y, Sato H, Matsuzawa N, Matsuoka S et al. Petascale general solver for semidefinite programming problems with over two million constraints. In Proceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014. IEEE Computer Society. 2014. p. 1171-1180. 6877345. (Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS). https://doi.org/10.1109/IPDPS.2014.121
Fujisawa, Katsuki ; Endo, Toshio ; Yasui, Yuichiro ; Sato, Hitoshi ; Matsuzawa, Naoki ; Matsuoka, Satoshi ; Waki, Hayato. / Petascale general solver for semidefinite programming problems with over two million constraints. Proceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014. IEEE Computer Society, 2014. pp. 1171-1180 (Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS).
@inproceedings{93eeb5b3c26a49cbbf0c21b2bcefa442,
title = "Petascale general solver for semidefinite programming problems with over two million constraints",
abstract = "The semi definite programming (SDP) problem is one of the central problems in mathematical optimization. The primal-dual interior-point method (PDIPM) is one of the most powerful algorithms for solving SDP problems, and many research groups have employed it for developing software packages. However, two well-known major bottlenecks, i.e., the generation of the Schur complement matrix (SCM) and its Cholesky factorization, exist in the algorithmic framework of the PDIPM. We have developed a new version of the semi definite programming algorithm parallel version (SDPARA), which is a parallel implementation on multiple CPUs and GPUs for solving extremely large-scale SDP problems with over a million constraints. SDPARA can automatically extract the unique characteristics from an SDP problem and identify the bottleneck. When the generation of the SCM becomes a bottleneck, SDPARA can attain high scalability using a large quantity of CPU cores and some processor affinity and memory interleaving techniques. SDPARA can also perform parallel Cholesky factorization using thousands of GPUs and techniques for overlapping computation and communication if an SDP problem has over two million constraints and Cholesky factorization constitutes a bottleneck. We demonstrate that SDPARA is a high-performance general solver for SDPs in various application fields through numerical experiments conducted on the TSUBAME 2.5 supercomputer, and 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.",
author = "Katsuki Fujisawa and Toshio Endo and Yuichiro Yasui and Hitoshi Sato and Naoki Matsuzawa and Satoshi Matsuoka and Hayato Waki",
year = "2014",
month = "1",
day = "1",
doi = "10.1109/IPDPS.2014.121",
language = "English",
isbn = "9780769552071",
series = "Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS",
publisher = "IEEE Computer Society",
pages = "1171--1180",
booktitle = "Proceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014",
address = "United States",

}

TY - GEN

T1 - Petascale general solver for semidefinite programming problems with over two million constraints

AU - Fujisawa, Katsuki

AU - Endo, Toshio

AU - Yasui, Yuichiro

AU - Sato, Hitoshi

AU - Matsuzawa, Naoki

AU - Matsuoka, Satoshi

AU - Waki, Hayato

PY - 2014/1/1

Y1 - 2014/1/1

N2 - The semi definite programming (SDP) problem is one of the central problems in mathematical optimization. The primal-dual interior-point method (PDIPM) is one of the most powerful algorithms for solving SDP problems, and many research groups have employed it for developing software packages. However, two well-known major bottlenecks, i.e., the generation of the Schur complement matrix (SCM) and its Cholesky factorization, exist in the algorithmic framework of the PDIPM. We have developed a new version of the semi definite programming algorithm parallel version (SDPARA), which is a parallel implementation on multiple CPUs and GPUs for solving extremely large-scale SDP problems with over a million constraints. SDPARA can automatically extract the unique characteristics from an SDP problem and identify the bottleneck. When the generation of the SCM becomes a bottleneck, SDPARA can attain high scalability using a large quantity of CPU cores and some processor affinity and memory interleaving techniques. SDPARA can also perform parallel Cholesky factorization using thousands of GPUs and techniques for overlapping computation and communication if an SDP problem has over two million constraints and Cholesky factorization constitutes a bottleneck. We demonstrate that SDPARA is a high-performance general solver for SDPs in various application fields through numerical experiments conducted on the TSUBAME 2.5 supercomputer, and 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.

AB - The semi definite programming (SDP) problem is one of the central problems in mathematical optimization. The primal-dual interior-point method (PDIPM) is one of the most powerful algorithms for solving SDP problems, and many research groups have employed it for developing software packages. However, two well-known major bottlenecks, i.e., the generation of the Schur complement matrix (SCM) and its Cholesky factorization, exist in the algorithmic framework of the PDIPM. We have developed a new version of the semi definite programming algorithm parallel version (SDPARA), which is a parallel implementation on multiple CPUs and GPUs for solving extremely large-scale SDP problems with over a million constraints. SDPARA can automatically extract the unique characteristics from an SDP problem and identify the bottleneck. When the generation of the SCM becomes a bottleneck, SDPARA can attain high scalability using a large quantity of CPU cores and some processor affinity and memory interleaving techniques. SDPARA can also perform parallel Cholesky factorization using thousands of GPUs and techniques for overlapping computation and communication if an SDP problem has over two million constraints and Cholesky factorization constitutes a bottleneck. We demonstrate that SDPARA is a high-performance general solver for SDPs in various application fields through numerical experiments conducted on the TSUBAME 2.5 supercomputer, and 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.

UR - http://www.scopus.com/inward/record.url?scp=84906672755&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906672755&partnerID=8YFLogxK

U2 - 10.1109/IPDPS.2014.121

DO - 10.1109/IPDPS.2014.121

M3 - Conference contribution

SN - 9780769552071

T3 - Proceedings of the International Parallel and Distributed Processing Symposium, IPDPS

SP - 1171

EP - 1180

BT - Proceedings - IEEE 28th International Parallel and Distributed Processing Symposium, IPDPS 2014

PB - IEEE Computer Society

ER -