TY - GEN
T1 - Can lock-free and combining techniques co-exist? A novel approach on concurrent queue
AU - Min, Changwoo
AU - Eom, Young Ik
PY - 2013
Y1 - 2013
N2 - Concurrent queues are one of the most fundamental concurrent data structures. Most previous research focuses on how to avoid the contended hot spots, Head and Tail, and there are two contradictory approaches: (1) lock-free techniques [1], [2], which increase the degree of parallelism to improve performance and (2) combining techniques [3], where a single combining thread performs a batch operation for the pending requests from other threads to reduce synchronization cost in a high degree of parallelism.
AB - Concurrent queues are one of the most fundamental concurrent data structures. Most previous research focuses on how to avoid the contended hot spots, Head and Tail, and there are two contradictory approaches: (1) lock-free techniques [1], [2], which increase the degree of parallelism to improve performance and (2) combining techniques [3], where a single combining thread performs a batch operation for the pending requests from other threads to reduce synchronization cost in a high degree of parallelism.
UR - https://www.scopus.com/pages/publications/84887413830
U2 - 10.1109/PACT.2013.6618837
DO - 10.1109/PACT.2013.6618837
M3 - Conference contribution
AN - SCOPUS:84887413830
SN - 9781479910212
T3 - Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT
SP - 403
BT - PACT 2013 - Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques
T2 - 22nd International Conference on Parallel Architectures and Compilation Techniques, PACT 2013
Y2 - 7 September 2013 through 11 September 2013
ER -