Scheduling for security-critical real-time applications on heterogeneous clusters

作者：Zhu Xiao Min^*; Lu Pei Zhong

来源：Chinese Journal of Computers, 2010, 33(12): 2364-2377.

DOI：10.3724/SP.J.1016.2010.02364

• Cluster systems
• Deadline
• Extensive simulations
• Heterogeneous clusters
• Novel algorithm
• Other algorithms
• Real-time
• Real-time application
• Real-time tasks
• Schedulability
• Scheduling strategies
• Second phase
• Security level
• Security requirements
• Security services
• Security-critical
• Slack time
• Timing constraints

Increasing attention has been directed towards the issue of security service for real-time applications with security requirements on clusters. In this paper, we propose a novel two-phase scheduling strategy TPSS which takes timing constraints and security needs of tasks into consideration. In the first phase, the authors propose a novel algorithm DSRF to schedule real-time tasks. When the system is in heavy burden, DSRF is able to degrade the security levels of new tasks and tasks waiting in local queues so as to enhance schedulability. On the contrary, when the system is in light burden, DSRF is capable of employing slack time to adequately improve the security qualities of new tasks. In the second phase, a new algorithm FMSL is proposed to minimize the difference of security levels of accepted tasks and further improve the security levels of these tasks on the whole, which degrades the probability of the applications being attacked. The authors compare TPSS, DSRF, SAEDF and RF by extensive simulation experiments. The experimental results indicate that TPSS significantly outperforms other algorithms and improves the security and flexibility of the cluster systems.

• 出版日期2010
• 单位复旦大学