Grid parallelizing of discrete optimization problems with quasi-block structure matrices
- 作者: Voloshinov V.1, Lemtyuzhnikova D.2, Tsurkov V.3
-
隶属关系:
- Institute for Information Transmission Problems
- Moscow Aviation Institute
- Computational Center of Federal Research Center Computer Science and Control
- 期: 卷 56, 编号 6 (2017)
- 页面: 930-936
- 栏目: Discrete Systems
- URL: https://journals.rcsi.science/1064-2307/article/view/220005
- DOI: https://doi.org/10.1134/S1064230717060144
- ID: 220005
如何引用文章
详细
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.
作者简介
V. Voloshinov
Institute for Information Transmission Problems
Email: tsurkov@ccas.ru
俄罗斯联邦, Moscow
D. Lemtyuzhnikova
Moscow Aviation Institute
Email: tsurkov@ccas.ru
俄罗斯联邦, Moscow
V. Tsurkov
Computational Center of Federal Research Center Computer Science and Control
编辑信件的主要联系方式.
Email: tsurkov@ccas.ru
俄罗斯联邦, Moscow
![](/img/style/loading.gif)