Parallel solver of large systems of linear inequalities using Fourier--Motzkin elimination
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F16%3A00306809" target="_blank" >RIV/68407700:21240/16:00306809 - isvavai.cz</a>
Result on the web
<a href="http://www.cai.sk/ojs/index.php/cai/article/view/2382" target="_blank" >http://www.cai.sk/ojs/index.php/cai/article/view/2382</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Parallel solver of large systems of linear inequalities using Fourier--Motzkin elimination
Original language description
Fourier-Motzkin elimination is a computationally expensive but powerful method to solve a system of linear inequalities. These systems arise e.g. in execution order analysis for loop nests or in integer linear programming. This paper focuses on the analysis, design and implementation of a~parallel solver for distributed memory for large systems of linear inequalities using the Fourier--Motzkin elimination algorithm. We also measure the speedup of parallel solver and prove that this implementation results in good scalability.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Computing and Informatics
ISSN
1335-9150
e-ISSN
—
Volume of the periodical
35
Issue of the periodical within the volume
6
Country of publishing house
SK - SLOVAKIA
Number of pages
31
Pages from-to
1307-1337
UT code for WoS article
—
EID of the result in the Scopus database
—