SMT-based scheduling for multiprocessor real-time systems

Real-time system is playing an important role in our society. For such a system, sensitivity to timing is the central feature of systems behaviors, which means tasks in the system are required to be completed before their deadlines. Currently, almost all the practical real-time systems are equipped within multiple processors, for which the schedule synthesis to make sure that all the tasks can be completed before their deadlines is known to be an NP complete problem. In this paper, to solve the scheduling problem, we propose a scheduling method based on satisfiability modulo theories (SMT). In the method, the problem of scheduling is treated as a satisfiability problem. The key work is to formalize the satisfiability problem using first-order language. After the formalization, a SMT solver (e.g., Z3, Yices) is employed to solver such a satisfiability problem. An optimal schedule can be generated based on a solution model returned by the SMT solver. Moreover, in the SMT-based scheduling method, we define the scheduling constraints as system constraints andtarget constraints. Such design makes the proposed method apply more widely compared with existing methods