Non-preemptive Scheduling with History-Dependent Execution Time

Bjorn Andersson,Sagar Chaki,Dionisio de Niz,Brian Dougherty,Russell Kegley,Jules White

ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems（2012）

引用 7|浏览2

暂无评分

摘要

Consider non-preemptive fixed-priority scheduling of arbitrary-deadline sporadic tasks on a single processor assuming that the execution time of a job J depends on the actual schedule (sequence) of jobs executed before J. We present exact schedulability analysis for such a system.

查看译文

关键词

job j,exact schedulability analysis,execution time,history-dependent execution time,non-preemptive scheduling,non-preemptive fixed-priority scheduling,single processor,actual schedule,arbitrary-deadline sporadic task,history,computational modeling,upper bound,scheduling,optimization,schedules

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要