<?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-01206442</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-20T12:19:40+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Why Non-Blocking Operations Should Be Selfish</title>
            <author role="aut">
              <persName>
                <forename type="first">Joel</forename>
                <surname>Gibson</surname>
              </persName>
              <idno type="halauthorid">949456-0</idno>
              <affiliation ref="#struct-5077"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Vincent</forename>
                <surname>Gramoli</surname>
              </persName>
              <email type="md5">8ba53f1f847dd750e1d88a3e608f4375</email>
              <email type="domain">sydney.edu.au</email>
              <idno type="idhal" notation="numeric">925408</idno>
              <idno type="halauthorid" notation="string">106401-925408</idno>
              <affiliation ref="#struct-5077"/>
              <affiliation ref="#struct-300765"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Matthieu</forename>
                <surname>Roy</surname>
              </persName>
              <email type="md5">2cc774ae4ae545900ca8af4f1e0a884c</email>
              <email type="domain">laas.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-09-29 09:56:44</date>
              <date type="whenModified">2024-12-06 14:22:03</date>
              <date type="whenReleased">2015-09-30 10:06:29</date>
              <date type="whenProduced">2015-10-05</date>
              <date type="whenEndEmbargoed">2015-10-05</date>
              <ref type="file" target="https://hal.science/hal-01206442v1/document">
                <date notBefore="2015-10-05"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01206442v1/file/20.pdf" id="file-1206442-1286304">
                <date notBefore="2015-10-05"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-01206442/file/20.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="131243">
                <persName>
                  <forename>Matthieu</forename>
                  <surname>Roy</surname>
                </persName>
                <email type="md5">2cc774ae4ae545900ca8af4f1e0a884c</email>
                <email type="domain">laas.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01206442</idno>
            <idno type="halUri">https://hal.science/hal-01206442</idno>
            <idno type="halBibtex">gibson:hal-01206442</idno>
            <idno type="halRefHtml">&lt;i&gt;DISC 2015&lt;/i&gt;, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-662-48653-5_14"&gt;&amp;#x27E8;10.1007/978-3-662-48653-5_14&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">DISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. &amp;#x27E8;10.1007/978-3-662-48653-5_14&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1206442-1286304"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="DISC2015">DIStributed Computing 2015</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="en">Why Non-Blocking Operations Should Be Selfish</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Joel</forename>
                    <surname>Gibson</surname>
                  </persName>
                  <idno type="halauthorid">949456-0</idno>
                  <affiliation ref="#struct-5077"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Vincent</forename>
                    <surname>Gramoli</surname>
                  </persName>
                  <email type="md5">8ba53f1f847dd750e1d88a3e608f4375</email>
                  <email type="domain">sydney.edu.au</email>
                  <idno type="idhal" notation="numeric">925408</idno>
                  <idno type="halauthorid" notation="string">106401-925408</idno>
                  <affiliation ref="#struct-5077"/>
                  <affiliation ref="#struct-300765"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>DISC 2015</title>
                  <date type="start">2015-10-05</date>
                  <settlement>Tokyo</settlement>
                  <country key="JP">Japan</country>
                </meeting>
                <respStmt>
                  <resp>conferenceOrganizer</resp>
                  <name>Toshimitsu Masuzawa</name>
                  <name>Koichi Wada</name>
                </respStmt>
                <editor>Yoram Moses</editor>
                <editor>Matthieu Roy</editor>
                <imprint>
                  <publisher>Springer-Verlag Berlin Heidelberg</publisher>
                  <biblScope unit="serie">29th International Symposium on Distributed Computing</biblScope>
                  <biblScope unit="volume">LNCS 9363</biblScope>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-662-48653-5_14</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">overlapping-interval contention</term>
                <term xml:lang="en">interval contention</term>
                <term xml:lang="en">process contention</term>
                <term xml:lang="en">point contention</term>
                <term xml:lang="en">wait-freedom</term>
                <term xml:lang="en">lock-freedom</term>
                <term xml:lang="en">Helping</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-dc">Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]</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="en">
              <p>Non-blocking data structures are often analysed by giving an upper amortised running time bound in terms of the size of the data structure and a measure of contention. The two most commonly used measures are the point contention cP , the maximum number of processes active at any one time during an operation, and the interval contention cI , the number of operations overlapping with a given operation. In this paper, we show that when summed across every operation in an exe- cution, the interval contention cI is within a factor of 2 of the point contention cP . Our proof relies on properties of interval graphs where at least one simplicial vertex exists, and uses it to construct a lower bound on the overall point contention. We show that this bound is tight.This result contradicts the folklore belief that point contention leads to a tighter bound on complexity in an amortised context, and provides some theoretical grounds for recent observations that using less helping in non-blocking data structures can lead to better performance. We also propose a linked list algorithm based on Fomitchev and Ruppert’s algorithm but with selfish operations: read-only operations that do not help others but rather execute wait-free. The higher performance of our approach compared to the original list confirms that reducing helping can increase performance, with the same asymptotic amortised complexity.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-5077" status="VALID">
          <orgName>School of Information Technologies [Sydney]</orgName>
          <orgName type="acronym">IT</orgName>
          <desc>
            <address>
              <addrLine>School of Information Technologies, J12 University of Sydney NSW 2006</addrLine>
              <country key="AU"/>
            </address>
            <ref type="url">http://www.it.usyd.edu.au/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-374701" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300765" status="VALID">
          <orgName>National ICT Australia [Sydney]</orgName>
          <orgName type="acronym">NICTA</orgName>
          <desc>
            <address>
              <country key="AU"/>
            </address>
            <ref type="url">https://www.nicta.com.au</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-374701" status="VALID">
          <idno type="ROR">https://ror.org/0384j8v12</idno>
          <orgName>The University of Sydney</orgName>
          <date type="start">1850-01-01</date>
          <desc>
            <address>
              <addrLine>New South Wales 2006</addrLine>
              <country key="AU"/>
            </address>
            <ref type="url">http://sydney.edu.au/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>