{'fraction_non_alphanumeric': 0.03088803088803089, 'fraction_numerical': 0.0, 'mean_word_length': 5.1726190476190474, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An SRP-based energy-efficient scheduling algorithm for dependent real-time tasks

In this paper, we are interested in the energy-efficient scheduling of dependent real-time tasks which may access multiunit resources. Based on the well-known stack resource policy (SRP), we propose the blocking-time stealing (BTS) algorithm to schedule dynamic-priority and fixed-priority tasks on a non-ideal dynamic voltage scaling (DVS) processor. Under the BTS algorithm, tasks are scheduled to be executed at proper processor speeds which are determined according to the sufficient schedulability conditions of the earliest deadline first (EDF) and the rate monotonic (RM) algorithms. The BTS algorithm measures dynamically the slack between the actual blocking time of a task and its estimated worst-case blocking time. The slack is then exploited to lower the processor speed guaranteeing that the feasibility of tasks is not affected. As a result, the energy consumption can be reduced while satisfying the timing constraints of real-time tasks.