QCSP based Schedulability Test of Real-time System
The problem of schedulability test of real-time task in scheduling system has been addressed.In such as real-time scheduling problems with uncertain interrupt operation,Quantified Constraint Satisfaction Problems (QCSP) were introduced to model and solve CSP involving uncertainty or uncontrollability on the value taken by some variables.In this paper,we propose to a novel approach to schedulability test based on the QCSP model.Based on the QCSP model of scheduler and interrupter in the real-time scheduling system,we transform the schedulability test into the satisfability problem.Finally,we design the algorithm QCSP-SchTest for judging the satisfability of a schedule S(α).This leads to a new schedulability test method without considering the specific scheduling algorithm or strategy.
Real-time Scheduling System Schedulability Test Constraint Programming Quantified Constraint Satisfaction Problem
ZHANG Juyang CHEN Yixiang
Software Engineering Institution,East China Normal University,Shanghai,P.R.China
国际会议
济南
英文
1214-1217
2012-12-29(万方平台首次上网日期,不代表论文的发表时间)