BPL is a spinlock that batches waiting tasks by request order and prioritizes within batches to cut average delay for high-priority tasks while keeping the same worst-case bound as FIFO locks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.OS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Bounded Priority-Aware Locking for Real-Time Kernels
BPL is a spinlock that batches waiting tasks by request order and prioritizes within batches to cut average delay for high-priority tasks while keeping the same worst-case bound as FIFO locks.