Answers are grounded in this paper and cite their sources.
Ensuring rapid responses to high‐priority tasks, balancing workloads across threads, and efficiently utilizing computing resources are essential to improving the performance of resource‐constrained multicore platforms. However, existing priority scheduling methods face two major challenges. (1) Global ordering strategies can reduce redundant computation, but frequent cross‐thread synchronization creates contention and significantly increases scheduling latency. (2) Local ordering strategies reduce communication overhead by using thread‐local queues, but their lack of global priority coordination can lead to priority drift and delayed execution of high‐priority tasks. To address these challenges, we propose the Stealing Multi‐Bucket Queue (SMBQ), an efficient priority scheduling framework for multicore systems. The framework combines a multiqueue strategy with priority‐aware probabilistic work stealing to mitigate priority drift while improving scheduling efficiency, using task batching to reduce locking operations and improve cache locality. Experimental results show that the proposed scheduler significantly outperforms state‐of‐the‐art priority schedulers such as OBIM and PMOD, providing an efficient and stable solution for priority task scheduling in multicore systems.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: