Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Multiword atomic read/write registers on multiprocessor systems
University of Borås, School of Business and IT. (CSL@BS)
Show others and affiliations
2009 (English)In: ACM Journal of Experimental Algorithmics, ISSN 1084-6654, E-ISSN 1084-6654, Vol. 13, no 1, p. 1.7-1.30Article in journal (Refereed) Published
Abstract [en]

Modern multiprocessor systems offer advanced synchronization primitives, built in hardware, to support the development of efficient parallel algorithms. In this article, we develop a simple and efficient algorithm, the READERSFIELD algorithm, for atomic registers (variables) of arbitrary length. The simplicity and better complexity of the algorithm is achieved via the utilization of two such common synchronization primitives. In this article, we also experimentally evaluate the performance of our algorithm, together with lock-based approaches and a practical, previously previously known algorithm that is based that is based only on read and write primitives. The experimental evaluation is performed on three well-known parallel architectures. This evaluation clearly shows that both algorithms are practical and that as the size of the register increases the READERSFIELD algorithm performs better, following its analytical evaluation.

Place, publisher, year, edition, pages
Association for Computing Machinery, Inc. , 2009. Vol. 13, no 1, p. 1.7-1.30
Keywords [en]
atomic register, wait-free, synchronization, Parallel Programming
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:hb:diva-2722DOI: 10.1145/1412228.1455262Local ID: 2320/5920OAI: oai:DiVA.org:hb-2722DiVA, id: diva2:870816
Funder
National Supercomputer Centre (NSC), Sweden
Note

Sponsorship:

This work was supported by computational resources provided by the Swedish National Supercomputer

Centre (NSC).

Available from: 2015-11-13 Created: 2015-11-13 Last updated: 2018-01-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Gidenstam, Anders

Search in DiVA

By author/editor
Gidenstam, Anders
By organisation
School of Business and IT
In the same journal
ACM Journal of Experimental Algorithmics
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 149 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf