Flow network-based real-time scheduling for reducing static energy consumption on multiprocessors

• Main Authors: Sun, Joohyung, Cho, Hyeonjoong, Easwaran, Arvind, Park, Ju-Derk, Choi, Byeong-Cheol
• Other Authors: School of Computer Science and Engineering
• Format: Article
• Language: English
• Published: 2019
• Subjects: DRNTU::Engineering::Computer science and engineering; Energy-aware Algorithm; Dynamic Power Management
• Online Access: https://hdl.handle.net/10356/105454; http://hdl.handle.net/10220/48703; http://dx.doi.org/10.1109/ACCESS.2018.2886562
• Institution: Nanyang Technological University

The energy management for embedded real-time systems is crucial due to their restricted power supplies. With the advancement of technologies, the static energy consumption of the embedded systems that is caused by their leakage power is growing. Thus, a number of research works have started focusing on reducing the static energy consumption by making the systems transit into low-power states, wherein some hardware components are temporarily shut down. Specifically, when a processor is idling, they attempt to set the processor into one of several low-power states. To make a processor remain in the low-power state as long as possible to minimize the energy consumption, the idle time should be maximally clustered. At the same time, in order to satisfy the real-time constraints of the tasks, the length of the clustered idle time should be estimated accurately. To achieve our objective, we propose energy-efficient real-time scheduling algorithms on symmetric homogeneous multiprocessors with a dynamic power management scheme for periodic real-time tasks. The proposed algorithms rely on a flow network model that effectively helps to cluster the idle time while respecting the real-time constraints. In our experimental evaluation, the proposed algorithms consume a comparable static energy to an existing off-line scheme that is the only suitable existing algorithm in the problem domain. Furthermore, we show that the proposed algorithms consume less static energy than the existing one in a case where the total workload of the given task set is low and the task completion is earlier than expected.