Zobrazit v EDS

Elastic Relaxation of Concurrent Data Structures

Uloženo v:
Podrobná bibliografie
Název: Elastic Relaxation of Concurrent Data Structures
Autoři: von Geijer, Kåre, 1998, Tsigas, Philippas, 1967
Zdroj: Anpassad datastruktursemantik för skalbar processering av data IEEE Transactions on Parallel and Distributed Systems. 36(12):2578-2595
Témata: Data Structures, Concurrent Programming, Semantics
Popis: The sequential semantics of many concurrent data structures, such as stacks and queues, inevitably lead to memory contention in parallel environments, thus limiting scalability. Semantic relaxation has the potential to address this issue, increasing the parallelism at the expense of weakened semantics. Although prior research has shown that improved performance can be attained by relaxing concurrent data structure semantics, there is no one-size-fits-all relaxation that adequately addresses the varying needs of dynamic executions. In this paper, we first introduce the concept of elastic relaxation and consequently present the Lateral structure, which is an algorithmic component capable of supporting the design of elastically relaxed concurrent data structures. Using the Lateral, we design novel elastically relaxed, lock-free queues, stacks, a counter, and a deque, capable of reconfiguring relaxation during run-time. We establish linearizability and define worst-case bounds for relaxation errors in our designs. Experimental evaluations show that our elastic designs match the performance of state-of-the-art statically relaxed structures when no elastic changes are utilized. We develop a lightweight, contention-aware controller for adjusting relaxation in real time, and demonstrate its benefits both in a dynamic producer-consumer micro-benchmark and in a parallel BFS traversal, where it improves throughput and work-efficiency compared to static designs.
Popis souboru: electronic
Přístupová URL adresa: https://research.chalmers.se/publication/547547
https://research.chalmers.se/publication/547547/file/547547_Fulltext.pdf
Databáze: SwePub
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://research.chalmers.se/publication/547547#
    Name: EDS - SwePub (s4221598)
    Category: fullText
    Text: View record in SwePub
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsswe&genre=article&issn=15582183&ISBN=&volume=36&issue=12&date=20250101&spage=2578&pages=2578-2595&title=Anpassad datastruktursemantik för skalbar processering av data IEEE Transactions on Parallel and Distributed Systems&atitle=Elastic%20Relaxation%20of%20Concurrent%20Data%20Structures&aulast=von%20Geijer%2C%20K%C3%A5re&id=DOI:10.1109/TPDS.2025.3587888
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=von%20Geijer%20K
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsswe
DbLabel: SwePub
An: edsswe.oai.research.chalmers.se.31b1cad1.6c07.4b60.90e5.b9125a29fb1f
RelevancyScore: 1115
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1114.736328125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Elastic Relaxation of Concurrent Data Structures
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22von+Geijer%2C+Kåre%22">von Geijer, Kåre</searchLink>, 1998<br /><searchLink fieldCode="AR" term="%22Tsigas%2C+Philippas%22">Tsigas, Philippas</searchLink>, 1967
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>Anpassad datastruktursemantik för skalbar processering av data IEEE Transactions on Parallel and Distributed Systems</i>. 36(12):2578-2595
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Data+Structures%22">Data Structures</searchLink><br /><searchLink fieldCode="DE" term="%22Concurrent+Programming%22">Concurrent Programming</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: The sequential semantics of many concurrent data structures, such as stacks and queues, inevitably lead to memory contention in parallel environments, thus limiting scalability. Semantic relaxation has the potential to address this issue, increasing the parallelism at the expense of weakened semantics. Although prior research has shown that improved performance can be attained by relaxing concurrent data structure semantics, there is no one-size-fits-all relaxation that adequately addresses the varying needs of dynamic executions. In this paper, we first introduce the concept of elastic relaxation and consequently present the Lateral structure, which is an algorithmic component capable of supporting the design of elastically relaxed concurrent data structures. Using the Lateral, we design novel elastically relaxed, lock-free queues, stacks, a counter, and a deque, capable of reconfiguring relaxation during run-time. We establish linearizability and define worst-case bounds for relaxation errors in our designs. Experimental evaluations show that our elastic designs match the performance of state-of-the-art statically relaxed structures when no elastic changes are utilized. We develop a lightweight, contention-aware controller for adjusting relaxation in real time, and demonstrate its benefits both in a dynamic producer-consumer micro-benchmark and in a parallel BFS traversal, where it improves throughput and work-efficiency compared to static designs.
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: electronic
– Name: URL
  Label: Access URL
  Group: URL
  Data: <link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/547547" linkWindow="_blank">https://research.chalmers.se/publication/547547</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/547547/file/547547_Fulltext.pdf" linkWindow="_blank">https://research.chalmers.se/publication/547547/file/547547_Fulltext.pdf</link>
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsswe&AN=edsswe.oai.research.chalmers.se.31b1cad1.6c07.4b60.90e5.b9125a29fb1f
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1109/TPDS.2025.3587888
    Languages:
      – Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 18
        StartPage: 2578
    Subjects:
      – SubjectFull: Data Structures
        Type: general
      – SubjectFull: Concurrent Programming
        Type: general
      – SubjectFull: Semantics
        Type: general
    Titles:
      – TitleFull: Elastic Relaxation of Concurrent Data Structures
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: von Geijer, Kåre
      – PersonEntity:
          Name:
            NameFull: Tsigas, Philippas
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 15582183
            – Type: issn-print
              Value: 10459219
            – Type: issn-locals
              Value: SWEPUB_FREE
            – Type: issn-locals
              Value: CTH_SWEPUB
          Numbering:
            – Type: volume
              Value: 36
            – Type: issue
              Value: 12
          Titles:
            – TitleFull: Anpassad datastruktursemantik för skalbar processering av data IEEE Transactions on Parallel and Distributed Systems
              Type: main
ResultId 1