Multi-word Atomic Read/Write Registers on Multiprocessor Systems
Artikel i vetenskaplig tidskrift, 2004

Modern multiprocessor systems offer advanced synchronization primitives, built in hardware, to support the development of efficient parallel algorithms. In this paper we develop a simple and efficient 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 paper we also evaluate the performance of our algorithm and the performance of a practical previously know algorithm that is based only on read and write primitives. The evaluation is performed on 3 well-known, parallel architectures. This evaluation clearly shows that both algorithms are practical and that as the size of the register increases our algorithm performs better, accordingly to its complexity behavior.

Författare

Andreas Larsson

Chalmers, Institutionen för datavetenskap, Datakommunikation och Distribuerade System

Anders Gidenstam

Chalmers, Institutionen för datavetenskap, Datakommunikation och Distribuerade System

Phuong Ha

Chalmers, Institutionen för datavetenskap, Datakommunikation och Distribuerade System

Marina Papatriantafilou

Chalmers, Institutionen för datavetenskap, Datakommunikation och Distribuerade System

Philippas Tsigas

Chalmers, Institutionen för datavetenskap, Datakommunikation och Distribuerade System

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 3221 736-748

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1007/978-3-540-30140-0_65

ISBN

3-540-23025-4

Mer information

Skapat

2017-10-06