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-ofthe- art algorithms by a factor of two.
| Original language | English |
|---|---|
| Pages (from-to) | 2956-2957 |
| Number of pages | 2 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E95-D |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 2012 |
Keywords
- Cache-line contention
- Compare-and-swap
- Fetch-and-store
- FIFO queue
- Multicore processor