Multi-Processor Schedulability Analysis Of Preemptive Real-Time Tasks With Variable Execution Times
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems(2007)
摘要
In this paper, we study schedulability analysis problems for multi-processor real-time systems. Assume a set of real-time tasks whose execution times and deadlines are known. We use timed automata to describe the non-deterministic arrival times of tasks. The schedulability problem is to check whether the released task instances can be executed within their given deadlines on a multi-processor platform where each. processor has a task queue to buffer task instances scheduled to run on the processor. On the positive side, we show that the problem is decidable for systems with non-preemptive schedulers or tasks with fixed execution times. A surprising negative result is that for multi-processor systems with variable task execution times and a preemptive scheduler, the schedulability analysis problem is undecidable, which is still an open problem in the single-processor setting.
更多查看译文
关键词
schedulability analysis problem,task instance,open problem,real-time task,schedulability problem,task queue,variable task execution time,execution time,fixed execution time,multi-processor platform,Multi-processor schedulability analysis,preemptive real-time task,variable execution time
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要