CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency

Anders Gidenstam ; Håkan Sundell ; Philippas Tsigas (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers))
PRINCIPLES OF DISTRIBUTED SYSTEMS, Lecture Notes in Computer Science (978-3-642-17652-4). Vol. 6490 (2010), p. 302-317.
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Concurrent Data Structures, FIFO QUEUES, Lock-Free, multicore, weak memory models

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-01-27. Senast ändrad 2011-02-18.
CPL Pubid: 136178


Läs direkt!

Länk till annan sajt (kan kräva inloggning)