SAREC-GA: A Security-Aware Real-Time Scheduling Algorithm with Genetic Algorithm
Shengwu Xiong, Yongxiang Zhao, Ning Xu · 2007
Security requirements of security-critical real-time applications must be met in addition to satisfying timing constraints. However, conventional real-time scheduling algorithms ignore the applications' security requirements. Tao Xie, Xiao Qin et al. have proposed a security-aware scheduling strategy, or SAREC, and scheduling algorithm SAREC-EDF, which integrates security requirements into scheduling for real-time applications. However, there are some disadvantages in his algorithms. The scheduling problem is a maximization optimization problem with constraints, but SAREC-EDF does not compare its solutions in global scope, just like greedy algorithm, as a result, its last result maybe not the best one. In this paper, on the one hand, we originally construct two mathematic models for the real-time scheduling problems considering security requirements. On the other hand, we propose a new security-aware real-time scheduling algorithm based on genetic algorithm (SAREC-GA), which can improve overall security level of the system by up to approximately 25% on the base of SAREC-EDF when real-time requirement is guaranteed. Experiment data and simulated results show the feasibility and availability of the proposed models and method.