Grid parallelizing of discrete optimization problems with quasi-block structure matrices
- Authors: Voloshinov V.V.1, Lemtyuzhnikova D.V.2, Tsurkov V.I.3
-
Affiliations:
- Institute for Information Transmission Problems
- Moscow Aviation Institute
- Computational Center of Federal Research Center Computer Science and Control
- Issue: Vol 56, No 6 (2017)
- Pages: 930-936
- Section: Discrete Systems
- URL: https://journals.rcsi.science/1064-2307/article/view/220005
- DOI: https://doi.org/10.1134/S1064230717060144
- ID: 220005
Cite item
Abstract
We consider discrete optimization problems with Boolean variables and rarefied matrices of large dimensions. In some cases we manage to extract the quasi-block structure of the initial matrices. In particular, in this paper we have problems with the so-called block-stair and block-tree structures. Blocks in such problems have connecting variables with other blocks. We present the parallelization of such large problems on GRID systems, where problems for separate blocks are solved independently of one another, and the initial problems cannot be directly solved due to the unacceptably large time requirements.
About the authors
V. V. Voloshinov
Institute for Information Transmission Problems
Email: tsurkov@ccas.ru
Russian Federation, Moscow
D. V. Lemtyuzhnikova
Moscow Aviation Institute
Email: tsurkov@ccas.ru
Russian Federation, Moscow
V. I. Tsurkov
Computational Center of Federal Research Center Computer Science and Control
Author for correspondence.
Email: tsurkov@ccas.ru
Russian Federation, Moscow