Parallel Fourier-Motzkin elimination
Identifieur interne : 002763 ( Main/Exploration ); précédent : 002762; suivant : 002764Parallel Fourier-Motzkin elimination
Auteurs : Christoph W. Ke Ler [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1996.
Abstract
Abstract: Fourier-Motzkin elimination is a computationally expensive but powerful method to solve a system of linear inequalities for real and integer solution spaces. Because it yields an explicit representation of the solution set, in contrast to other methods such as Simplex, one may, in some cases, take its longer run time into account. We show in this paper that it is possible to considerably speed up Fourier-Motzkin elimination by massively parallel processing. We present a parallel implementation for a shared memory parallel computer, and sketch several variants for distributed memory parallelization.
Url:
DOI: 10.1007/BFb0024686
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000B16
- to stream Istex, to step Curation: 000A53
- to stream Istex, to step Checkpoint: 001037
- to stream Main, to step Merge: 002C37
- to stream Main, to step Curation: 002763
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Parallel Fourier-Motzkin elimination</title><author><name sortKey="Ke Ler, Christoph W" sort="Ke Ler, Christoph W" uniqKey="Ke Ler C" first="Christoph W." last="Ke Ler">Christoph W. Ke Ler</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:4A2F32C88090A61AC61A9B11E0AD9C2B722D166E</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/BFb0024686</idno><idno type="url">https://api.istex.fr/document/4A2F32C88090A61AC61A9B11E0AD9C2B722D166E/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000B16</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000B16</idno><idno type="wicri:Area/Istex/Curation">000A53</idno><idno type="wicri:Area/Istex/Checkpoint">001037</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001037</idno><idno type="wicri:doubleKey">0302-9743:1996:Ke Ler C:parallel:fourier:motzkin</idno><idno type="wicri:Area/Main/Merge">002C37</idno><idno type="wicri:Area/Main/Curation">002763</idno><idno type="wicri:Area/Main/Exploration">002763</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Parallel Fourier-Motzkin elimination</title><author><name sortKey="Ke Ler, Christoph W" sort="Ke Ler, Christoph W" uniqKey="Ke Ler C" first="Christoph W." last="Ke Ler">Christoph W. Ke Ler</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich 4 - Informatik, UniversitÄt Trier, D-54286, Trier</wicri:regionArea><wicri:noRegion>54286, Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1996</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">4A2F32C88090A61AC61A9B11E0AD9C2B722D166E</idno><idno type="DOI">10.1007/BFb0024686</idno><idno type="ChapterID">9</idno><idno type="ChapterID">Chap9</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Fourier-Motzkin elimination is a computationally expensive but powerful method to solve a system of linear inequalities for real and integer solution spaces. Because it yields an explicit representation of the solution set, in contrast to other methods such as Simplex, one may, in some cases, take its longer run time into account. We show in this paper that it is possible to considerably speed up Fourier-Motzkin elimination by massively parallel processing. We present a parallel implementation for a shared memory parallel computer, and sketch several variants for distributed memory parallelization.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Ke Ler, Christoph W" sort="Ke Ler, Christoph W" uniqKey="Ke Ler C" first="Christoph W." last="Ke Ler">Christoph W. Ke Ler</name></noRegion><name sortKey="Ke Ler, Christoph W" sort="Ke Ler, Christoph W" uniqKey="Ke Ler C" first="Christoph W." last="Ke Ler">Christoph W. Ke Ler</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002763 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002763 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:4A2F32C88090A61AC61A9B11E0AD9C2B722D166E
|texte= Parallel Fourier-Motzkin elimination
}}
| This area was generated with Dilib version V0.6.31. |  |