@inproceedings{5af1f69947874fb59fdde47f55a3af61,
title = "Wait-free queues with multiple enqueuers and dequeuers",
abstract = "The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues exist. Until now, only versions with limited concurrency were proposed. In this paper we provide a design for a practical wait-free queue. Our construction is based on the highly efficient lock-free queue of Michael and Scott. To achieve wait-freedom, we employ a prioritybased helping scheme in which faster threads help the slower peers to complete their pending operations. We have implemented our scheme on multicore machines and present performance measurements comparing our implementation with that of Michael and Scott in several system configurations.",
keywords = "Concurrent queues, Wait-free algorithms",
author = "Alex Kogan and Erez Petrank",
year = "2011",
doi = "10.1145/1941553.1941585",
language = "الإنجليزيّة",
isbn = "9781450301190",
series = "Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP",
pages = "223--233",
booktitle = "PPoPP'11 - Proceedings of the 2011 ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming",
note = "16th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP'11 ; Conference date: 12-02-2011 Through 16-02-2011",
}