Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency
Paper i proceeding, 2010

A lock-free FIFO queue data structure is presented in this paper. The algorithm supports multiple producers and multiple consumers and weak memory models. It has been designed to be cache-aware and work directly on weak memory models. It utilizes the cache behavior in concert with lazy updates of shared data, and a dynamic lock-free memory management scheme to decrease unnecessary synchronization and increase performance. Experiments on an 8-way multi-core platform show significantly better performance for the new algorithm compared to previous fast lock-free algorithms.

Lock-Free

weak memory models

multicore

FIFO QUEUES

Concurrent Data Structures

Författare

Anders Gidenstam

Högskolan i Borås

Håkan Sundell

Högskolan i Borås

Philippas Tsigas

Chalmers, Data- och informationsteknik, Nätverk och system

PRINCIPLES OF DISTRIBUTED SYSTEMS, Lecture Notes in Computer Science

1611-3349 (eISSN)

Vol. 6490 302-317

Styrkeområden

Informations- och kommunikationsteknik

Fundament

Grundläggande vetenskaper

Ämneskategorier

Programvaruteknik

Datavetenskap (datalogi)

DOI

10.1007/978-3-642-17653-1_23

ISBN

0302-9743