<?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-04816363</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-05-18T01:35:45+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">What about a two-dimensional virtual address space?</title>
            <title xml:lang="fr">Proposition d'architecture généraliste ayant un espace d'adresses virtuelles bidimensionnel</title>
            <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-491187"/>
            </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 ref="#projanr-56181"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2024-12-03 18:10:09</date>
              <date type="whenWritten">2024-08-02</date>
              <date type="whenModified">2026-02-05 10:34:01</date>
              <date type="whenReleased">2024-12-04 17:01:44</date>
              <date type="whenProduced">2024-12</date>
              <date type="whenEndEmbargoed">2024-12-03</date>
              <ref type="file" target="https://inria.hal.science/hal-04816363v1/document">
                <date notBefore="2024-12-03"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-04816363v1/file/RR-9563.pdf" id="file-4816363-4196795">
                <date notBefore="2024-12-03"/>
              </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-04816363</idno>
            <idno type="halUri">https://inria.hal.science/hal-04816363</idno>
            <idno type="halBibtex">michaud:hal-04816363</idno>
            <idno type="halRefHtml">RR-9563, Inria. 2024, pp.27</idno>
            <idno type="halRef">RR-9563, Inria. 2024, pp.27</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-4816363-4196795"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <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="UNIV-UBS">Université de Bretagne Sud</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="INRIA-RRRT">Rapports de recherche et Technique de l'Inria</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="CENTRALESUPELEC">Ecole CentraleSupélec</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="LARA">LARA</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="ANR">ANR</idno>
            <idno type="stamp" n="UR1-MATH-NUM">Pôle UnivRennes - Mathématiques - Numérique </idno>
          </seriesStmt>
          <notesStmt/>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">What about a two-dimensional virtual address space?</title>
                <title xml:lang="fr">Proposition d'architecture généraliste ayant un espace d'adresses virtuelles bidimensionnel</title>
                <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-491187"/>
                </author>
              </analytic>
              <monogr>
                <idno type="reportNumber">RR-9563</idno>
                <imprint>
                  <biblScope unit="pp">27</biblScope>
                  <date type="datePub">2024-12</date>
                </imprint>
                <authority type="institution">Inria</authority>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">pointer</term>
                <term xml:lang="en">array</term>
                <term xml:lang="en">array jeu d'instructions</term>
                <term xml:lang="en">architecture</term>
                <term xml:lang="en">mémoire virtuelle</term>
                <term xml:lang="en">traduction d'adresses</term>
                <term xml:lang="en">programmation pour la performance</term>
                <term xml:lang="en">pointeur</term>
                <term xml:lang="en">tableau</term>
                <term xml:lang="en">performance-aware programming</term>
                <term xml:lang="en">cache</term>
                <term xml:lang="en">TLB</term>
                <term xml:lang="en">microarchitecture</term>
                <term xml:lang="en">address translation</term>
                <term xml:lang="en">virtual memory</term>
                <term xml:lang="en">instruction-set architecture</term>
                <term xml:lang="fr">pointeur</term>
                <term xml:lang="fr">tableau</term>
                <term xml:lang="fr">programmation pour la performance</term>
                <term xml:lang="fr">cache</term>
                <term xml:lang="fr">TLB</term>
                <term xml:lang="fr">microarchitecture</term>
                <term xml:lang="fr">traduction d'adresses</term>
                <term xml:lang="fr">mémoire virtuelle</term>
                <term xml:lang="fr">architecture</term>
                <term xml:lang="fr">jeu d'instructions</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-ar">Computer Science [cs]/Hardware Architecture [cs.AR]</classCode>
              <classCode scheme="halTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halOldTypology" n="REPORT">Reports</classCode>
              <classCode scheme="halTreeTypology" n="REPORT.RESREPORT">Reports - Research report</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The virtual address space offered by existing instruction set architectures (ISA) is generally one-dimensional. That is, a virtual address is represented by a single number. We consider the possibility of a two-dimensional (2D) address space where a virtual address consists of two independent numbers, an X coordinate and a Y coordinate. We propose and describe a hypothetical ISA, called XYA, offering a 2D virtual address space. We explain how a XYA CPU would differ from a conventional CPU and we propose a C-like language for programming a XYA machine. We identify a set of XYA features that conventional ISAs do not have and we explain how performance-aware programmers can exploit these features.</p>
            </abstract>
            <abstract xml:lang="fr">
              <p>Les jeux d'instructions existants ont un espace d'adresses virtuelles unidimensionnel, une adresses virtuelle étant représentée par un nombre entier. Dans ce document, nous considérons la possibilité d'un espace d'adresses virtuelles à deux dimensions, une adresse virtuelle consistant en deux nombres indépendants, une coordonnée X et une coordonnée Y. Nous proposons un jeu d'instructions hypothétique, nommé XYA, ayant un espace d'addresses virtuelles bidimensionnel. Ce document met en évidence les principales différences entre un processeur XYA et un processeur classique. Nous proposons un langage de programmation ressemblant au langage C et permettant d'exploiter la mémoire bidimensionnelle d'une machine XYA. Enfin, nous soulignons certaines caractéristiques de XYA, différentes des jeux d'instructions classiques, et montrons comment les programmeurs peuvent les exploiter pour obtenir des programmes s'exécutant plus rapidement.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-491187" status="VALID">
          <idno type="RNSR">201622151M</idno>
          <idno type="ROR">https://ror.org/059z1ye11</idno>
          <orgName>Pushing Architecture and Compilation for Application Performance</orgName>
          <orgName type="acronym">PACAP</orgName>
          <date type="start">2017-01-01</date>
          <date type="end">2026-12-31</date>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu 35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inria.fr/equipes/pacap</ref>
          </desc>
          <listRelation>
            <relation active="#struct-419153" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-491183" type="direct"/>
            <relation active="#struct-490899" type="indirect"/>
            <relation active="#struct-105160" type="indirect"/>
            <relation active="#struct-117606" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-172265" type="indirect"/>
            <relation active="#struct-247362" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation name="UMR6074" active="#struct-441569" type="indirect"/>
            <relation active="#struct-481355" type="indirect"/>
            <relation active="#struct-302102" type="indirect"/>
          </listRelation>
        </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>
        <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="department" xml:id="struct-491183" status="VALID">
          <orgName>ARCHITECTURE</orgName>
          <orgName type="acronym">IRISA-D3</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.irisa.fr/fr/departements/d3-architecture</ref>
          </desc>
          <listRelation>
            <relation active="#struct-490899" type="direct"/>
            <relation active="#struct-105160" type="indirect"/>
            <relation active="#struct-117606" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-172265" type="indirect"/>
            <relation active="#struct-247362" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation name="UMR6074" active="#struct-441569" type="indirect"/>
            <relation active="#struct-481355" type="indirect"/>
            <relation active="#struct-302102" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-490899" status="VALID">
          <idno type="IdRef">026386909</idno>
          <idno type="ISNI">0000 0001 2298 7270</idno>
          <idno type="RNSR">200012163A</idno>
          <idno type="ROR">https://ror.org/00myn0z94</idno>
          <orgName>Institut de Recherche en Informatique et Systèmes Aléatoires</orgName>
          <orgName type="acronym">IRISA</orgName>
          <date type="start">2017-01-01</date>
          <desc>
            <address>
              <addrLine>Avenue du général LeclercCampus de Beaulieu 35042 RENNES CEDEX</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-172265" type="direct"/>
            <relation active="#struct-247362" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR6074" active="#struct-441569" type="direct"/>
            <relation active="#struct-481355" type="direct"/>
            <relation active="#struct-302102" type="indirect"/>
          </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-172265" status="VALID">
          <idno type="IdRef">05017746X</idno>
          <idno type="ISNI">0000000121680285</idno>
          <idno type="ROR">https://ror.org/04ed7fw48</idno>
          <orgName>Université de Bretagne Sud</orgName>
          <orgName type="acronym">UBS</orgName>
          <date type="start">1995-02-07</date>
          <desc>
            <address>
              <addrLine>BP 92116 - 56321 Lorient cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-ubs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-247362" status="VALID">
          <idno type="ROR">https://ror.org/03rxtdc22</idno>
          <orgName>École normale supérieure - Rennes</orgName>
          <orgName type="acronym">ENS Rennes</orgName>
          <desc>
            <address>
              <addrLine>Campus de Ker Lann - avenue Robert Schuman - 35170 Bruz</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-rennes.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</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="institution" xml:id="struct-481355" status="VALID">
          <idno type="IdRef">202743233</idno>
          <idno type="ROR">https://ror.org/030hj3061</idno>
          <orgName>IMT Atlantique</orgName>
          <orgName type="acronym">IMT Atlantique</orgName>
          <date type="start">2017-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Brest : Technopôle Brest-Iroise CS 8381829238 BREST Cedex 3 -Campus Nantes : 4, rue Alfred Kastler- La chantrerie 44300 NANTES -Campus Rennes :  2 Rue de la Châtaigneraie, 35510 CESSON SEVIGNE</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt-atlantique.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-302102" status="VALID">
          <idno type="IdRef">192427156</idno>
          <idno type="ISNI">000000012202567X</idno>
          <idno type="ROR">https://ror.org/025vp2923</idno>
          <idno type="Wikidata">Q27962533</idno>
          <orgName>Institut Mines-Télécom [Paris]</orgName>
          <orgName type="acronym">IMT</orgName>
          <date type="start">2012-03-01</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt.fr/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-56181" status="VALID">
          <idno type="anr">ANR-21-CE25-0016</idno>
          <orgName>Maplurinum</orgName>
          <desc>Machinæ pluribus unum - (faire) une seule machine avec plusieurs</desc>
          <date type="start">2021</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>