Data structureresearch
Fine-grained concurrent heap
Also called Hunt et al. concurrent heap.
Binary heap with per-node locks and bit-reversed insertion order, letting inserts and deletes proceed in parallel.
Binary heap with per-node locks and bit-reversed insertion order, letting inserts and deletes proceed in parallel.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 5B1WV2 Edit this page History Report an error