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.
In Proceedings of the 6th Asia-Paci/f_ic Workshop on Systems (APSys ’15)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A survey reviewing and categorizing academic and commercial systems for objective nutritional data collection using emerging technologies.
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.
-
A Survey of Automatic Methods for Nutritional Assessment
A survey reviewing and categorizing academic and commercial systems for objective nutritional data collection using emerging technologies.