作者: Edya Ladan-Mozes , Nir Shavit
DOI: 10.1007/978-3-540-30186-8_9
关键词: Parallel computing 、 Concurrency 、 Data structure 、 Compare-and-swap 、 Double-ended queue 、 Concurrent data structure 、 Queue management system 、 Computer science 、 FIFO (computing and electronics) 、 Non-blocking algorithm 、 Queue
摘要: First-in-first-out (FIFO) queues are among the most fundamental and highly studied concurrent data structures. The effective practical dynamic-memory queue implementation in literature is lock-free FIFO algorithm of Michael Scott, included standard Java TM Concurrency Package.