MORA: an Energy-Aware Slack Reclamation Scheme for Scheduling Sporadic Real-Time Tasks upon Multiprocessor Platforms
Vincent Nelis, Joel Goossens

TL;DR
This paper introduces MORA, an online energy-aware scheduling scheme for multiprocessor systems that reclaims slack to reduce energy consumption by slowing processors, saving up to 32% energy without compromising schedulability.
Contribution
MORA is a novel slack reclamation algorithm that considers application-specific profiles to optimize energy savings in real-time multiprocessor scheduling.
Findings
MORA can save up to 32% of energy on average.
It maintains system schedulability while reducing energy consumption.
Simulation results validate the effectiveness of MORA.
Abstract
In this paper, we address the global and preemptive energy-aware scheduling problem of sporadic constrained-deadline tasks on DVFS-identical multiprocessor platforms. We propose an online slack reclamation scheme which profits from the discrepancy between the worst- and actual-case execution time of the tasks by slowing down the speed of the processors in order to save energy. Our algorithm called MORA takes into account the application-specific consumption profile of the tasks. We demonstrate that MORA does not jeopardize the system schedulability and we show by performing simulations that it can save up to 32% of energy (in average) compared to execution without using any energy-aware algorithm.
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
TopicsReal-Time Systems Scheduling · Embedded Systems Design Techniques · Parallel Computing and Optimization Techniques
