<?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-01148318</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-20T14:09:47+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="fr">Construction universelle d'objets partagés sans connaissance des participants</title>
            <author role="aut">
              <persName>
                <forename type="first">Pierre</forename>
                <surname>Sutra</surname>
              </persName>
              <email type="md5">9271404ac78c8889340b192e90a0d8b3</email>
              <email type="domain">telecom-sudparis.eu</email>
              <idno type="idhal" notation="string">psutra</idno>
              <idno type="idhal" notation="numeric">7436</idno>
              <idno type="halauthorid" notation="string">29029-7436</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-0573-2572</idno>
              <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=3avWQ3cAAAAJ&amp;hl=en</idno>
              <idno type="IDREF">https://www.idref.fr/153522089</idno>
              <idno type="ARXIV">https://arxiv.org/a/sutra_p_1otrack</idno>
              <affiliation ref="#struct-300663"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Étienne</forename>
                <surname>Rivière</surname>
              </persName>
              <idno type="idhal" notation="numeric">768172</idno>
              <idno type="halauthorid" notation="string">392591-768172</idno>
              <idno type="IDREF">https://www.idref.fr/177540974</idno>
              <affiliation ref="#struct-300663"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Pascal</forename>
                <surname>Felber</surname>
              </persName>
              <idno type="halauthorid">143586-0</idno>
              <affiliation ref="#struct-300663"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Pierre</forename>
                <surname>Sutra</surname>
              </persName>
              <email type="md5">9271404ac78c8889340b192e90a0d8b3</email>
              <email type="domain">telecom-sudparis.eu</email>
            </editor>
            <funder ref="#projeurop-101857"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-05-04 23:54:34</date>
              <date type="whenWritten">2015-05-04</date>
              <date type="whenModified">2025-05-15 12:09:33</date>
              <date type="whenReleased">2015-05-05 13:10:08</date>
              <date type="whenProduced">2015-06-02</date>
              <date type="whenEndEmbargoed">2015-05-04</date>
              <ref type="file" target="https://hal.science/hal-01148318v1/document">
                <date notBefore="2015-05-04"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01148318v1/file/paper%20%281%29.pdf" id="file-1148318-1230969">
                <date notBefore="2015-05-04"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="115327">
                <persName>
                  <forename>Pierre</forename>
                  <surname>Sutra</surname>
                </persName>
                <email type="md5">9271404ac78c8889340b192e90a0d8b3</email>
                <email type="domain">telecom-sudparis.eu</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01148318</idno>
            <idno type="halUri">https://hal.science/hal-01148318</idno>
            <idno type="halBibtex">sutra:hal-01148318</idno>
            <idno type="halRefHtml">&lt;i&gt;ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications&lt;/i&gt;, Jun 2015, Beaune, France</idno>
            <idno type="halRef">ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1148318-1230969"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="ALGOTEL2015" corresp="ALGOTEL">ALGOTEL 2015 - Dix-septièmes Rencontres Francophones pour les Aspects Algorithmiques des Télécommunications</idno>
            <idno type="stamp" n="TSP-PARALLEL-DISTRIBUTED-SYSTEMS">Parallel and Distributed Systems group</idno>
            <idno type="stamp" n="ALGOTEL">Rencontre Francophone sur les Aspects Algorithmiques des Télécommunications</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="fr">Construction universelle d'objets partagés sans connaissance des participants</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Pierre</forename>
                    <surname>Sutra</surname>
                  </persName>
                  <email type="md5">9271404ac78c8889340b192e90a0d8b3</email>
                  <email type="domain">telecom-sudparis.eu</email>
                  <idno type="idhal" notation="string">psutra</idno>
                  <idno type="idhal" notation="numeric">7436</idno>
                  <idno type="halauthorid" notation="string">29029-7436</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-0573-2572</idno>
                  <idno type="GOOGLE SCHOLAR">https://scholar.google.fr/citations?user=3avWQ3cAAAAJ&amp;hl=en</idno>
                  <idno type="IDREF">https://www.idref.fr/153522089</idno>
                  <idno type="ARXIV">https://arxiv.org/a/sutra_p_1otrack</idno>
                  <affiliation ref="#struct-300663"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Étienne</forename>
                    <surname>Rivière</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">768172</idno>
                  <idno type="halauthorid" notation="string">392591-768172</idno>
                  <idno type="IDREF">https://www.idref.fr/177540974</idno>
                  <affiliation ref="#struct-300663"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Pascal</forename>
                    <surname>Felber</surname>
                  </persName>
                  <idno type="halauthorid">143586-0</idno>
                  <affiliation ref="#struct-300663"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>ALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications</title>
                  <date type="start">2015-06-02</date>
                  <date type="end">2015-06-05</date>
                  <settlement>Beaune</settlement>
                  <country key="FR">France</country>
                </meeting>
                <imprint/>
              </monogr>
              <ref target="https://github.com/otrack/PSSOLib" type="seeAlso"/>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="fr">French</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">Consensus</term>
                <term xml:lang="fr">Construction Universelle</term>
                <term xml:lang="fr">Objet Partagé</term>
                <term xml:lang="fr">Concurrence</term>
                <term xml:lang="fr">Mémoire partagée</term>
              </keywords>
              <classCode scheme="acm" n="D.3.3.2">D.: Software/D.3: PROGRAMMING LANGUAGES/D.3.3: Language Constructs and Features/D.3.3.2: Concurrent programming structures</classCode>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="fr">
              <p>Une construction universelle est un algorithme permettant à un ensemble de processus concurrents d'accéder à un objet partagé en ayant l'illusion que celui-ci est disponible localement. Dans cet article, nous présentons un algorithme permettant la mise en oeuvre d'une telle construction dans un système à mémoire partagée. Notre construction est sans verrou, et contrairement aux approches proposées précédemment, ne nécessite pas que les processus accédant à l'objet partagé soient connus. De plus, elle est adaptative : en notant n le nombre total de processus dans le système et k &lt;= n le nombre de processus qui utilisent l'objet partagé, tout processus effectue Θ(k) pas de calcul en l'absence de contention.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-300663" status="VALID">
          <idno type="ROR">https://ror.org/00vasag41</idno>
          <orgName>Université de Neuchâtel = University of Neuchatel</orgName>
          <orgName type="acronym">UNINE</orgName>
          <desc>
            <address>
              <addrLine>Av. du 1er-Mars 26, 2000 Neuchâtel</addrLine>
              <country key="CH"/>
            </address>
            <ref type="url">http://www.unine.ch/</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="europeanProject" xml:id="projeurop-101857" status="VALID">
          <idno type="number">318809</idno>
          <idno type="program">FP7-ICT-2011-8</idno>
          <idno type="call">FP7-ICT-2011-8</idno>
          <orgName>LEADS</orgName>
          <desc>LEADS: Large-Scale Elastic Architecture for Data as a Service</desc>
          <date type="start">2012-01-10</date>
          <date type="end">2015-09-30</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>