QCSP Based Schedulability Test of Real-Time System

Abstract

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.