Fast and Scalable k-FIFO Queues ?

@inproceedings{Kirsch2012FastAS,
  title={Fast and Scalable k-FIFO Queues ?},
  author={Christoph M. Kirsch and Michael Lippautz and Hannes Payer},
  year={2012}
}
We introduce fast and scalable algorithms that implement boundedand unbounded-size, lock-free, linearizable k-FIFO queues with empty (and full) check. Logically, a k-FIFO queue can be understood as queue where each element may be dequeued out-of-order up to k− 1 or as pool where each element is dequeued within a k-bounded number of dequeue operations. We show experimentally that there exist optimal and robust k that result in best performance and scalability. We then demonstrate that our… CONTINUE READING
Highly Cited
This paper has 18 citations. REVIEW CITATIONS

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…