Efficient wait-free implementation of a concurrent priority queue

DOI10.1007/3-540-57271-6_23MaRDI QIDQ4266514zbMATH OpenFDO

Authors Amos Israeli, Lihu Rappoport

Publication date 4 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57271-6_23

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(1)

• Software transactional memory

This page was built for publication: Efficient wait-free implementation of a concurrent priority queue

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4266514)