Partitioned Scheduling of Recurrent Real-Time Tasks
2021 IEEE Real-Time Systems Symposium (RTSS)(2021)
摘要
The partitioned scheduling of periodic and sporadic task systems upon multiprocessor platforms (both identical and heterogeneous) is considered. The computational complexity of a large number of such partitioned schedulability problems is examined. New lower and upper bounds on complexity are presented for several problems. Some problems are pigeonholed into their precise complexity classes in thi...
更多查看译文
关键词
Upper bound,Processor scheduling,Real-time systems,Complexity theory,Task analysis,Computational complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要