Scheduling expression DAGs for minimal register need
Identifieur interne : 002335 ( Main/Exploration ); précédent : 002334; suivant : 002336Scheduling expression DAGs for minimal register need
Auteurs : C. W. Kessler [Allemagne]Source :
- Computer Languages [ 0096-0551 ] ; 1998.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Generating schedules for expression DAGs that use a minimal number of registers is a classical NP-complete optimization problem. Up to now an exact solution could only be computed for small DAGs (with up to 20 nodes), using a trivial O(n!) enumeration algorithm. We present a new algorithm with worst-case complexity O(n22n) and very good average behavior. Applying a dynamic programming scheme and reordering techniques, our algorithm is able to defer the combinatorial explosion and to generate an optimal schedule not only for small DAGs but also for medium-sized ones with up to 50 nodes, a class that contains nearly all DAGs encountered in typical application programs. Experiments with randomly generated DAGs and large DAGs from real application programs confirm that the new algorithm generates optimal schedules quite fast. We extend our algorithm to cope with delay slots and multiple functional units, two common features of modern superscalar processors.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 001127
- to stream PascalFrancis, to step Curation: 001698
- to stream PascalFrancis, to step Checkpoint: 000E59
- to stream Main, to step Merge: 002730
- to stream Main, to step Curation: 002335
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Scheduling expression DAGs for minimal register need</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>Universitaet Trier</s1><s2>Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Universitaet Trier</wicri:noRegion><wicri:noRegion>Universitaet Trier</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">98-0346250</idno><date when="1998">1998</date><idno type="stanalyst">PASCAL 98-0346250 EI</idno><idno type="RBID">Pascal:98-0346250</idno><idno type="wicri:Area/PascalFrancis/Corpus">001127</idno><idno type="wicri:Area/PascalFrancis/Curation">001698</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000E59</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000E59</idno><idno type="wicri:doubleKey">0096-0551:1998:Kessler C:scheduling:expression:dags</idno><idno type="wicri:Area/Main/Merge">002730</idno><idno type="wicri:Area/Main/Curation">002335</idno><idno type="wicri:Area/Main/Exploration">002335</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Scheduling expression DAGs for minimal register need</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>Universitaet Trier</s1><s2>Trier</s2><s3>DEU</s3><sZ>1 aut.</sZ></inist:fA14><country>Allemagne</country><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Universitaet Trier</wicri:noRegion><wicri:noRegion>Universitaet Trier</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Computer Languages</title><title level="j" type="abbreviated">Comput Lang</title><idno type="ISSN">0096-0551</idno><imprint><date when="1998">1998</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Computer Languages</title><title level="j" type="abbreviated">Comput Lang</title><idno type="ISSN">0096-0551</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term><term>Application</term><term>Code generation</term><term>Computational complexity</term><term>Dynamic programming</term><term>Instruction scheduling</term><term>Program compilers</term><term>Program optimization</term><term>Register allocation</term><term>Storage allocation (computer)</term><term>Theory</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Application</term><term>Complexité calcul</term><term>Algorithme</term><term>Programmation dynamique</term><term>Allocation mémoire</term><term>Compilateur</term><term>Théorie</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Generating schedules for expression DAGs that use a minimal number of registers is a classical NP-complete optimization problem. Up to now an exact solution could only be computed for small DAGs (with up to 20 nodes), using a trivial O(n!) enumeration algorithm. We present a new algorithm with worst-case complexity O(n22n) and very good average behavior. Applying a dynamic programming scheme and reordering techniques, our algorithm is able to defer the combinatorial explosion and to generate an optimal schedule not only for small DAGs but also for medium-sized ones with up to 50 nodes, a class that contains nearly all DAGs encountered in typical application programs. Experiments with randomly generated DAGs and large DAGs from real application programs confirm that the new algorithm generates optimal schedules quite fast. We extend our algorithm to cope with delay slots and multiple functional units, two common features of modern superscalar processors.</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 002335 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002335 | 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:98-0346250
|texte= Scheduling expression DAGs for minimal register need
}}
| This area was generated with Dilib version V0.6.31. |  |