Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1587/transinf.E95.D.2956 | IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS |
Keywords | Field | DocType |
FIFO queue, multicore processor, cache-line contention, compare-and-swap, fetch-and-store | Computer architecture,Cache,Computer science,Parallel computing,Fifo queue,Multi-core processor,Compare-and-swap,Scalability | Journal |
Volume | Issue | ISSN |
E95D | 12 | 0916-8532 |
Citations | PageRank | References |
1 | 0.35 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Changwoo Min | 1 | 294 | 29.89 |
| Hyung Kook Jun | 2 | 3 | 1.76 |
| Won Tae Kim | 3 | 61 | 12.27 |
| Young Ik Eom | 4 | 316 | 58.40 |