New Abstraction for Optimal Real-Time Scheduling on Multiprocessors

Kenji Funaoka,Shinpei Kato,Nobuyuki Yamasaki

Kaohsiung（2008）

引用 6|浏览0

暂无评分

摘要

T-R Plane Abstraction (TRPA) proposed in this paper is an abstraction technique of real-time scheduling on multiprocessors. This paper presents that NNLF (No Nodal Laxity First) based on TRPA is work-conserving and optimally solves the problem of scheduling periodic tasks on a multiprocessor system. TRPA can accommodate to dynamic environments due to its dynamic time reservation, while T-N Plane Abstraction (TNPA) and Extended TNPA (E-TNPA) reserve processor time statically at every task release.

查看译文

关键词

real-time scheduling,multiprocessor system,new abstraction,reserve processor time statically,optimal real-time scheduling,nodal laxity first,dynamic time reservation,extended tnpa,t-r plane abstraction,t-n plane abstraction,dynamic environment,abstraction technique,scheduling,real time systems,schedules,fluids,artificial neural networks

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要