A new approximation algorithm for the register allocation problem
Identifieur interne : 000F78 ( Istex/Checkpoint ); précédent : 000F77; suivant : 000F79A new approximation algorithm for the register allocation problem
Auteurs : Klaus Jansen [Allemagne] ; Joachim Reiter [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1997.
Abstract
Abstract: In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can be solved by coloring the corresponding conflict graph G=(V, E). We describe a new approximation algorithm with constant worst case rate for flow graphs with constant branching depth. The algorithm works in two steps. In the first step, the lifetimes are enlarged such that the lifetimes form one unique interval across the different possible execution paths for each variable. We prove that the conflict graph ¯G with enlarged lifetimes satisfies ω(¯G)≤(2d+1)ω(G) where ω(G) is the cardinality of a maximum clique in G. In the second step, we propose an algorithm with approximation bound (d+1)ξ(¯G) for ¯G, using its specific structure.
Url:
DOI: 10.1007/3-540-63138-0_13
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:C3666B3D1622CC52BA82A1D266A8C2D6080D4CE4Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A new approximation algorithm for the register allocation problem</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></author><author><name sortKey="Reiter, Joachim" sort="Reiter, Joachim" uniqKey="Reiter J" first="Joachim" last="Reiter">Joachim Reiter</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:C3666B3D1622CC52BA82A1D266A8C2D6080D4CE4</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1007/3-540-63138-0_13</idno><idno type="url">https://api.istex.fr/document/C3666B3D1622CC52BA82A1D266A8C2D6080D4CE4/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001513</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001513</idno><idno type="wicri:Area/Istex/Curation">001401</idno><idno type="wicri:Area/Istex/Checkpoint">000F78</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000F78</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A new approximation algorithm for the register allocation problem</title><author><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Mathematik, Universität Trier, 54 286, Trier</wicri:regionArea><wicri:noRegion>Trier</wicri:noRegion><wicri:noRegion>Trier</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author><author><name sortKey="Reiter, Joachim" sort="Reiter, Joachim" uniqKey="Reiter J" first="Joachim" last="Reiter">Joachim Reiter</name><affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country><wicri:regionArea>Fachbereich IV, Wirtschaftsinformatik, Universität Trier, 54 286, Trier</wicri:regionArea><wicri:noRegion>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>1997</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">C3666B3D1622CC52BA82A1D266A8C2D6080D4CE4</idno><idno type="DOI">10.1007/3-540-63138-0_13</idno><idno type="ChapterID">13</idno><idno type="ChapterID">Chap13</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: In this paper we study the problem of register allocation in the presence of parallel conditional branches with a given branching depth d. We start from a scheduled flow graph and the goal is to find an assignment of the variables in the flow graph to a minimum number of registers. This problem can be solved by coloring the corresponding conflict graph G=(V, E). We describe a new approximation algorithm with constant worst case rate for flow graphs with constant branching depth. The algorithm works in two steps. In the first step, the lifetimes are enlarged such that the lifetimes form one unique interval across the different possible execution paths for each variable. We prove that the conflict graph ¯G with enlarged lifetimes satisfies ω(¯G)≤(2d+1)ω(G) where ω(G) is the cardinality of a maximum clique in G. In the second step, we propose an algorithm with approximation bound (d+1)ξ(¯G) for ¯G, using its specific structure.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name></noRegion><name sortKey="Jansen, Klaus" sort="Jansen, Klaus" uniqKey="Jansen K" first="Klaus" last="Jansen">Klaus Jansen</name><name sortKey="Reiter, Joachim" sort="Reiter, Joachim" uniqKey="Reiter J" first="Joachim" last="Reiter">Joachim Reiter</name><name sortKey="Reiter, Joachim" sort="Reiter, Joachim" uniqKey="Reiter J" first="Joachim" last="Reiter">Joachim Reiter</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000F78 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000F78 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:C3666B3D1622CC52BA82A1D266A8C2D6080D4CE4
|texte= A new approximation algorithm for the register allocation problem
}}
| This area was generated with Dilib version V0.6.31. |  |