Lightweight contention management for efficient compare-and-swap operations

David Dice, Danny Hendler, Ilya Mirsky

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Many concurrent data-structure implementations use the well-known compare-and-swap (CAS) operation, supported in hardware by most modern multiprocessor architectures, for inter-thread synchronization. A key weakness of the CAS operation is the degradation in its performance in the presence of memory contention. In this work we study the following question: can software-based contention management improve the efficiency of hardware-provided CAS operations? Our performance evaluation establishes that lightweight contention management support can greatly improve performance under medium and high contention levels while typically incurring only small overhead when contention is low.

Original languageAmerican English
Title of host publicationEuro-Par 2013 Parallel Processing - 19th International Conference, Proceedings
Pages595-606
Number of pages12
DOIs
StatePublished - 3 Sep 2013
Event19th International Conference on Parallel Processing, Euro-Par 2013 - Aachen, Germany
Duration: 26 Aug 201330 Aug 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8097 LNCS

Conference

Conference19th International Conference on Parallel Processing, Euro-Par 2013
Country/TerritoryGermany
CityAachen
Period26/08/1330/08/13

Keywords

  • Compare-and-swap
  • concurrent algorithms
  • contention management

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Lightweight contention management for efficient compare-and-swap operations'. Together they form a unique fingerprint.

Cite this