Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking [chapter]

Nan Guan, Zonghua Gu, Qingxu Deng, Shuaihong Gao, Ge Yu
2007 Lecture Notes in Computer Science  
To determine schedulability of priority-driven periodic tasksets on multi-processor systems, it is necessary to rely on utilization bound tests that are safe but pessimistic, since there is no known method for exact schedulability analysis for multi-processor systems analogous to the response time analysis algorithm for single-processor systems. In this paper, we use model-checking to provide a technique for exact multiprocessor scheduability analysis by modeling the real-time multi-tasking
more » ... em with Timed Automata (TA), and transforming the schedulability analysis problem into the reachability checking problem of the TA model.
doi:10.1007/978-3-540-75664-4_26 fatcat:o3hj5yggizgnfji52svbguknay