Ratio-Based Aggressive Reclaim Algorithm for Mixed Task Sets

This paper aims to investigate the scheduling problem of a mixed task set in a real-time system. When a mixed task set is executed, a scheduling algorithm should consider system energy consumption and the average response time of aperiodic jobs. This paper proposes the Ratio-based Aggressive Reclaim...

Full description

Saved in:
Bibliographic Details
Published in2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing pp. 2042 - 2049
Main Author Chin-Fu Kuo
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2013
Subjects
Aggressive Reclaim
Bandwidth
Energy
Energy consumption
Equations
Mixed Task Set
Processor scheduling
Response Time
Schedules
Servers
Time factors
Online AccessGet full text

Cover

More Information
Summary:This paper aims to investigate the scheduling problem of a mixed task set in a real-time system. When a mixed task set is executed, a scheduling algorithm should consider system energy consumption and the average response time of aperiodic jobs. This paper proposes the Ratio-based Aggressive Reclaim Algorithm (RARA) that reclaims unused execution time left by earlier-completed jobs and possible slack time reserved by the Total Bandwidth (TB) server but not used by aperiodic jobs for next jobs. A user-defined ratio is used to flexibly control the amount of slack time. A series of experiments are conducted to evaluate the proposed algorithm. The experimental results demonstrate that the RARA scheme with a suitable value of the user-defined variable has a better performance compared with the Mutual Reclaiming Scheme and the Bandwidth Sharing Scheme. From the experimental results, we observe that a smaller ratio value will significantly improve the system energy consumption and the average response time of aperiodic jobs.
DOI:10.1109/HPCC.and.EUC.2013.294