A Novel Schedulability Test Algorithm for Preemptive Real-Time Scheduling Problem in QCSP

In such as Real-time Scheduling Problems with uncertain interrupt operation, Quantified Constraint Satisfaction Problems were introduced to model and solve Constraint Satisfaction Problems involving uncertainty or uncontrollability on the value taken by some variables. In the former work, we propose to implement the schedulability test by using the algorithm QCSP-SchTest. In this paper, we analysis the search procedure in QCSP-SchTest and give a new algorithm QCSP-SchTest2 which combines the standard backtracking search with a repair-based procedure. A search state is best described as a strategy where we try to set the existential variables so that for all values of the universals there is a solution.