Energy-Efficient Computation with DVFS using Deep Reinforcement Learning for Multi-Task Systems in Edge Computing

TL;DR

This paper proposes a reinforcement learning-based approach for dynamic voltage and frequency scaling (DVFS) in multi-task edge computing systems, improving energy efficiency while meeting task deadlines.

Contribution

It introduces a novel method encoding kernel time series data for RL-based DVFS, handling complex multi-task, multi-deadline scenarios on edge devices.

Findings

Achieved 3%-10% power savings over Linux governors.

Validated on Jetson Nano with various multitask workloads.

Demonstrated adaptability to different workload patterns.

Abstract

Finding an optimal energy-efficient policy that is adaptable to underlying edge devices while meeting deadlines for tasks has always been challenging. This research studies generalized systems with multi-task, multi-deadline scenarios with reinforcement learning-based DVFS for energy saving for periodic soft real-time applications on edge devices. This work addresses the limitation of previous work that models a periodic system as a single task and single-deadline scenario, which is too simplified to cope with complex situations. The method encodes time series data in the Linux kernel into information that is easy to interpret for reinforcement learning, allowing the system to generate DVFS policies to adapt system patterns based on the general workload. For encoding, we present two different methods for comparison. Both methods use only one performance counter: system utilization, and the kernel only needs minimal information from the userspace. Our method is implemented on Jetson Nano Board (2GB) and is tested with three fixed multitask workloads, which are three, five, and eight tasks in the workload, respectively. For randomness and generalization, we also designed a random workload generator to build different multitask workloads to test. Based on the test results, our method could save 3%-10% power compared to Linux built-in governors.