DMCA
Multiword Atomic Read/Write Registers on Multiprocessor Systems
Cached
Download Links
BibTeX
@MISC{Larsson_multiwordatomic,
author = {Andreas Larsson and Anders Gidenstam and Phuong H. Ha},
title = {Multiword Atomic Read/Write Registers on Multiprocessor Systems},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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 known algorithm 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. Categories and Subject Descriptors: E.1 [Data structures]; D.1.3 [Programming Techniques]: Concurrent Programming—Parallel programming
Keyphrases
multiword atomic read write register multiprocessor system data structure analytical evaluation modern multiprocessor system lock-based approach common synchronization primitive efficient algorithm advanced synchronization primitive efficient parallel algorithm readersfield algorithm subject descriptor write primitive experimental evaluation readersfield algorithm performs concurrent programming parallel programming well-known parallel architecture arbitrary length atomic register
