IEICE TRANSACTIONS on Information
Scalable Cache-Optimized Concurrent FIFO Queue for Multicore Architectures
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E95-D No.12 pp.2956-2957
- Publication Date
- 2012/12/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E95.D.2956
- Type of Manuscript
- Special Section LETTER (Special Section on Parallel and Distributed Computing and Networking)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Changwoo MIN, Hyung Kook JUN, Won Tae KIM, Young Ik EOM, "Scalable Cache-Optimized Concurrent FIFO Queue for Multicore Architectures" in IEICE TRANSACTIONS on Information,
vol. E95-D, no. 12, pp. 2956-2957, December 2012, doi: 10.1587/transinf.E95.D.2956.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E95.D.2956/_p
Copy
@ARTICLE{e95-d_12_2956,
author={Changwoo MIN, Hyung Kook JUN, Won Tae KIM, Young Ik EOM, },
journal={IEICE TRANSACTIONS on Information},
title={Scalable Cache-Optimized Concurrent FIFO Queue for Multicore Architectures},
year={2012},
volume={E95-D},
number={12},
pages={2956-2957},
abstract={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.},
keywords={},
doi={10.1587/transinf.E95.D.2956},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Scalable Cache-Optimized Concurrent FIFO Queue for Multicore Architectures
T2 - IEICE TRANSACTIONS on Information
SP - 2956
EP - 2957
AU - Changwoo MIN
AU - Hyung Kook JUN
AU - Won Tae KIM
AU - Young Ik EOM
PY - 2012
DO - 10.1587/transinf.E95.D.2956
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E95-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2012
AB - 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.
ER -
English
