Scalable Cache-Optimized Concurrent FIFO Queue for Multicore Architectures

Changwoo MIN  Hyung Kook JUN  Won Tae KIM  Young Ik EOM  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E95-D   No.12   pp.2956-2957
Publication Date: 2012/12/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.E95.D.2956
Print ISSN: 0916-8532
Type of Manuscript: Special Section LETTER (Special Section on Parallel and Distributed Computing and Networking)
Category: 
Keyword: 
FIFO queue,  multicore processor,  cache-line contention,  compare-and-swap,  fetch-and-store,  

Full Text: PDF(230.1KB)>>
Buy this Article




Summary: 
A concurrent FIFO queue is a widely used fundamental data structure for parallelizing software. In this letter, we introduce a novel concurrent FIFO queue algorithm for multicore architecture. We achieve better scalability by reducing contention among concurrent threads, and improve performance by optimizing cache-line usage. Experimental results on a server with eight cores show that our algorithm outperforms state-of-the-art algorithms by a factor of two.