Locality-Aware Process Scheduling for Embedded MPSoCs
Mahmut Kandemir, Guilin Chen

TL;DR
This paper introduces a cache-aware OS process scheduling method for embedded MPSoCs that improves data locality and reduces task completion times by considering data sharing and reuse among processes.
Contribution
It presents a novel OS-level scheduling strategy that enhances cache utilization by grouping data-sharing processes and separating non-sharing ones, improving performance.
Findings
Significant reduction in task completion times
Improved cache efficiency through data locality awareness
Effective scheduling strategy for embedded MPSoCs
Abstract
Utilizing on-chip caches in embedded multiprocessor-system-on-a-chip (MPSoC) based systems is critical from both performance and power perspectives. While most of the prior work that targets at optimizing cache behavior are performed at hardware and compilation levels, operating system (OS) can also play major role as it sees the global access pattern information across applications. This paper proposes a cache-conscious OS process scheduling strategy based on data reuse. The proposed scheduler implements two complementary approaches. First, the processes that do not share any data between them are scheduled at different cores if it is possible to do so. Second, the processes that could not be executed at the same time (due to dependences) but share data among each other are mapped to the same processor core so that they share the cache contents. Our experimental results using this new…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Real-Time Systems Scheduling · Interconnection Networks and Systems
