Schedulability of Blocking Threads
Manuel Coutinho, Carlos Almeida · IEEE Embedded Systems Letters · 2020
Real-time systems usually consist of a set of interdependent periodic and sporadic threads. Scheduling theory has modeled thus far this interdependency with semaphores with priority protocols (inheritance/ceiling). However, RTOS services are far more comprehensive, including message queues, sleeps, counting semaphores, etc. This letter presents a novel scheduling theory based on response time analysis (RTA) to determine the schedulability of periodic or sporadic threads that can be blocked/suspended for a specified maximum amount of time under a fixed-priority pre-emptive scheduler.