The Lock-free k-LSM Relaxed Priority Queue

@inproceedings{Wimmer2015TheLK,
  title={The Lock-free k-LSM Relaxed Priority Queue},
  author={Martin Wimmer and Jakob Gruber and Jesper Larsson Tr{\"a}ff and Philippas Tsigas},
  booktitle={PPOPP},
  year={2015}
}
We present a new, concurrent, lock-free priority queue that relaxes the delete-min operation to allow deletion of any of the ρ smallest keys instead of only a minimal one, where ρ is a parameter that can be configured at runtime. It is built from a logarithmic number of sorted arrays, similar to log-structured merge-trees (LSM). For keys added and removed by the same thread the behavior is identical to a non-relaxed priority queue. We compare to state-of-the-art lock-free priority queues with… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
14 Citations
4 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Variations on Task Scheduling for Shared Memory Systems

  • M. Wimmer
  • PhD thesis, Vienna University of Technology,
  • 2014
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…