Lock-free concurrent binomial heaps

DOI10.1016/j.jlamp.2018.08.001zbMath1400.68063OpenAlexW2888431946WikidataQ129338715 ScholiaQ129338715MaRDI QIDQ1994357

Gavin Lowe

Publication date: 1 November 2018

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:f7833406-bc72-4b20-90fc-e0f2e89fa0a4

zbMATH Keywords

linearizabilitylock-freedombinomial heapsconcurrent datatypes

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)

Related Items (1)

Special issue on the tenth workshop on programming language approaches to concurrency- and communication-centric software

Uses Software

• CBPQ
• SprayList

Cites Work

• Combining funnels: A dynamic approach to software combining
• Fast and lock-free concurrent priority queues for multi-thread systems
• A data structure for manipulating priority queues
• An improved equivalence algorithm

This page was built for publication: Lock-free concurrent binomial heaps