Parallel Fourier-Motzkin elimination
Identifieur interne : 002821 ( Main/Exploration ); précédent : 002820; suivant : 002822Parallel Fourier-Motzkin elimination
Auteurs : C. W. Kessler [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 001414
- to stream PascalFrancis, to step Curation: 001578
- to stream PascalFrancis, to step Checkpoint: 001195
- to stream Main, to step Merge: 002C97
- to stream Main, to step Curation: 002821
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Parallel Fourier-Motzkin elimination</title><author><name sortKey="Kessler, C W" sort="Kessler, C W" uniqKey="Kessler C" first="C. W." last="Kessler">C. W. Kessler</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Fachbereich 4 - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">97-0133308</idno><date when="1996">1996</date><idno type="stanalyst">PASCAL 97-0133308 INIST</idno><idno type="RBID">Pascal:97-0133308</idno><idno type="wicri:Area/PascalFrancis/Corpus">001414</idno><idno type="wicri:Area/PascalFrancis/Curation">001578</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">001195</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">001195</idno><idno type="wicri:doubleKey">0302-9743:1996:Kessler C:parallel:fourier:motzkin</idno><idno type="wicri:Area/Main/Merge">002C97</idno><idno type="wicri:Area/Main/Curation">002821</idno><idno type="wicri:Area/Main/Exploration">002821</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Parallel Fourier-Motzkin elimination</title><author><name sortKey="Kessler, C W" sort="Kessler, C W" uniqKey="Kessler C" first="C. W." last="Kessler">C. W. Kessler</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Fachbereich 4 - Informatik, Universität Trier</s1><s2>54286 Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>54286 Trier</wicri:noRegion><wicri:noRegion>Universität Trier</wicri:noRegion><wicri:noRegion>54286 Trier</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="1996">1996</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Inequality</term><term>Massive parallelism</term><term>Parallel processing</term><term>Parallelization</term><term>Problem solving</term><term>Shared memory</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Résolution problème</term><term>Inégalité</term><term>Traitement parallèle</term><term>Parallélisme massif</term><term>Parallélisation</term><term>Mémoire partagée</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">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="Kessler, C W" sort="Kessler, C W" uniqKey="Kessler C" first="C. W." last="Kessler">C. W. Kessler</name></noRegion></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 002821 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002821 | 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é= Pascal:97-0133308
|texte= Parallel Fourier-Motzkin elimination
}}
| This area was generated with Dilib version V0.6.31. |  |