Energy efficient dynamic scheduling of dependent tasks for multi‐core real‐time systems using delay techniques

Abstract

SummaryOptimizing energy consumption and maximizing throughput in multi‐core real‐time architectures through dynamic task scheduling is a critical design challenge. While significant attention has been devoted to addressing this challenge in the domain of real‐time multi‐core scheduling, the focus has primarily centered on considering periodic tasks as independent. However, the existing literature notably lacks comprehensive study of scheduling methodologies on multi‐core systems that consider dependent tasks, though typical real‐time systems execute tasks that share resources. Earlier studies have predominantly examined scenarios involving random new tasks and task instances (jobs), which are executed in different power levels. Each task (and job) has distinct execution time corresponding to each power level. By considering these parameters (power levels and execution times of jobs), various combinations of energy signatures have been found to attain an optimum system state. Building upon this prior research, our paper extends the scope to encompass task scheduling in multi‐core systems with task dependencies. We introduce a novel approach that categorizes dependent tasks into ASAP (as soon as possible) and ALAP (as late as possible) groups, prioritizing task execution based on task mobility—defined as the disparity between the last cycle the task can be scheduled in and the current cycle. Furthermore, our model demonstrates an approach for efficient scheduling of sporadic and aperiodic tasks within this framework. Through experimental validation using randomized task sets, our results indicate that the proposed model achieves a minimum of 5% reduction in normalized total energy consumption compared to existing methodologies.