<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03408381</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-04-30T15:31:53+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">A case for (partially) tagged geometric history length branch prediction</title>
            <author role="aut">
              <persName>
                <forename type="first">André</forename>
                <surname>Seznec</surname>
              </persName>
              <email type="md5">05f3886597aebbac57800792892621a2</email>
              <email type="domain">irisa.fr</email>
              <idno type="idhal" notation="string">andre-seznec</idno>
              <idno type="idhal" notation="numeric">13729</idno>
              <idno type="halauthorid" notation="string">23657-13729</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3058-6503</idno>
              <idno type="IDREF">https://www.idref.fr/033236402</idno>
              <affiliation ref="#struct-2512"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Pierre</forename>
                <surname>Michaud</surname>
              </persName>
              <email type="md5">53ac6822725bfce493f505edbca1ea6b</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">pmichaud</idno>
              <idno type="idhal" notation="numeric">738135</idno>
              <idno type="halauthorid" notation="string">800-738135</idno>
              <affiliation ref="#struct-2512"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Pierre</forename>
                <surname>Michaud</surname>
              </persName>
              <email type="md5">53ac6822725bfce493f505edbca1ea6b</email>
              <email type="domain">inria.fr</email>
            </editor>
            <funder>This work was partially supported by an Intel research grant and an Intel research equipment donation.</funder>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2021-10-29 16:36:18</date>
              <date type="whenModified">2025-03-28 03:07:24</date>
              <date type="whenReleased">2021-11-02 15:20:30</date>
              <date type="whenProduced">2006-02</date>
              <date type="whenEndEmbargoed">2021-10-29</date>
              <ref type="file" target="https://inria.hal.science/hal-03408381v1/document">
                <date notBefore="2021-10-29"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03408381v1/file/JILP-COTTAGE.pdf" id="file-3408381-2991407">
                <date notBefore="2021-10-29"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="114024">
                <persName>
                  <forename>Pierre</forename>
                  <surname>Michaud</surname>
                </persName>
                <email type="md5">53ac6822725bfce493f505edbca1ea6b</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03408381</idno>
            <idno type="halUri">https://inria.hal.science/hal-03408381</idno>
            <idno type="halBibtex">seznec:hal-03408381</idno>
            <idno type="halRefHtml">&lt;i&gt;The Journal of Instruction-Level Parallelism&lt;/i&gt;, 2006, 8, pp.23</idno>
            <idno type="halRef">The Journal of Instruction-Level Parallelism, 2006, 8, pp.23</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3408381-2991407"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="EC-PARIS">Ecole Centrale Paris</idno>
            <idno type="stamp" n="UNIV-RENNES1">Université de Rennes 1</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INSA-RENNES">Institut National des Sciences Appliquées de Rennes</idno>
            <idno type="stamp" n="INRIA-RENNES">INRIA Rennes - Bretagne Atlantique</idno>
            <idno type="stamp" n="IRISA">Irisa</idno>
            <idno type="stamp" n="IRISA_SET">IRISA_SET</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UR1-HAL">Publications labos UR1 dans HAL-Rennes 1</idno>
            <idno type="stamp" n="UR1-MATH-STIC">UR1 - publications Maths-STIC</idno>
            <idno type="stamp" n="UR1-UFR-ISTIC">UFR ISTIC Informatique et électronique</idno>
            <idno type="stamp" n="TEST-UR-CSS">TEST Université de Rennes CSS</idno>
            <idno type="stamp" n="UNIV-RENNES">Université de Rennes</idno>
            <idno type="stamp" n="INRIA-RENGRE">INRIA-RENGRE</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="UR1-MATH-NUM">Pôle UnivRennes - Mathématiques - Numérique </idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">A case for (partially) tagged geometric history length branch prediction</title>
                <author role="aut">
                  <persName>
                    <forename type="first">André</forename>
                    <surname>Seznec</surname>
                  </persName>
                  <email type="md5">05f3886597aebbac57800792892621a2</email>
                  <email type="domain">irisa.fr</email>
                  <idno type="idhal" notation="string">andre-seznec</idno>
                  <idno type="idhal" notation="numeric">13729</idno>
                  <idno type="halauthorid" notation="string">23657-13729</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3058-6503</idno>
                  <idno type="IDREF">https://www.idref.fr/033236402</idno>
                  <affiliation ref="#struct-2512"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Pierre</forename>
                    <surname>Michaud</surname>
                  </persName>
                  <email type="md5">53ac6822725bfce493f505edbca1ea6b</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">pmichaud</idno>
                  <idno type="idhal" notation="numeric">738135</idno>
                  <idno type="halauthorid" notation="string">800-738135</idno>
                  <affiliation ref="#struct-2512"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">1455</idno>
                <idno type="issn">1942-9525</idno>
                <title level="j">The Journal of Instruction-Level Parallelism</title>
                <imprint>
                  <publisher>North Carolina State University</publisher>
                  <biblScope unit="volume">8</biblScope>
                  <biblScope unit="pp">23</biblScope>
                  <date type="datePub">2006-02</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">branch prediction</term>
                <term xml:lang="en">TAGE</term>
              </keywords>
              <classCode scheme="https://dl.acm.org/ccs" n="ACM2012.C.0.0.2"/>
              <classCode scheme="halDomain" n="info.info-ar">Computer Science [cs]/Hardware Architecture [cs.AR]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>It is now widely admitted that in order to provide state-of-the-art accuracy, a conditional branch predictor must combine several predictions. Recent research has shown that an adder tree is a very effective approach for the prediction combination function. In this paper, we present a more cost effective solution for this prediction combination function for predictors relying on several predictor components indexed with different history lengths. Using geometric history length as the O-GEHL predictor, the TAGE predictor uses (partially) tagged components as the PPM-like predictor. TAGE relies on (partial) hit-miss detection as the prediction computation function. TAGE provides state-of-the-art prediction accuracy on conditional branches. In particular, at equivalent storage budgets, the TAGE predictor significantly outperforms all the predictors that were presented at the Championship Branch Prediction in december 2004. The accuracy of the prediction of the targets of indirect branches is a major issue on some applications. We show that the principles of the TAGE predictor can be directly applied to the prediction of indirect branches. The ITTAGE predictor (Indirect Target TAgged GEometric history length) significantly outperforms previous state-of-the-art indirect target branch predictors. Both TAGE and ITTAGE predictors feature tagged predictor components indexed with distinct history lengths forming a geometric series. They can be associated in a single cost-effective predictor, sharing tables and predictor logic, the COTTAGE predictor (COnditional and indirect Target TAgged GEometric history length).</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2512" status="OLD">
          <idno type="RNSR">199418355G</idno>
          <orgName>Compilation, parallel architectures and system</orgName>
          <orgName type="acronym">CAPS</orgName>
          <date type="start">1994-05-01</date>
          <date type="end">2008-12-31</date>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu, 35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/caps</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2494" type="direct"/>
            <relation active="#struct-105160" type="indirect"/>
            <relation active="#struct-117606" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="ESA6074 / URA227" active="#struct-441569" type="indirect"/>
            <relation active="#struct-419153" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2494" status="OLD">
          <orgName>Institut de Recherche en Informatique et Systèmes Aléatoires</orgName>
          <orgName type="acronym">IRISA</orgName>
          <date type="start">1980-01-01</date>
          <date type="end">1999-12-31</date>
          <desc>
            <address>
              <addrLine>Campus universitaire de Beaulieu - 35042 Rennes</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.irisa.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-105160" type="direct"/>
            <relation active="#struct-117606" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="ESA6074 / URA227" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-105160" status="VALID">
          <idno type="IdRef">26693823X</idno>
          <idno type="ROR">https://ror.org/015m7wh34</idno>
          <orgName>Université de Rennes</orgName>
          <orgName type="acronym">UR</orgName>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu, 263 avenue Général Leclerc, CS 74205, 35042 RENNES CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-rennes.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-117606" status="VALID">
          <idno type="ROR">https://ror.org/04xaa4j22</idno>
          <orgName>Institut National des Sciences Appliquées - Rennes</orgName>
          <orgName type="acronym">INSA Rennes</orgName>
          <desc>
            <address>
              <addrLine>20, avenue des Buttes de Coësmes - CS 70839 - 35708 Rennes cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-rennes.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-419153" status="VALID">
          <idno type="RNSR">198018249C</idno>
          <idno type="ROR">https://ror.org/04040yw90</idno>
          <orgName>Centre Inria de l'Université de Rennes</orgName>
          <desc>
            <address>
              <addrLine>Campus de beaulieu35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/rennes</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>