SAREC-GA: A SECURITY-AWARE REAL-TIME SCHEDULING ALGORITHM WITH GENETIC ALGORITHM
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 SAKEC, 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.
Real-Time scheduling Real-Time systems Security awareness Genetic algorithm
SHENG-WU XIONG YONG-XIANG ZHAO NING XU
School of Computer Science and Technology, Wuhan University of Technology, Wuhan 430070, China
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
3122-3127
2007-08-19(万方平台首次上网日期,不代表论文的发表时间)