Real-Time Analysis of Servers for General Job Arrivals
RTCSA), 2011 IEEE 17th International Conference(2011)
摘要
Several servers have been proposed to schedule streams of a periodic jobs in the presence of other periodic tasks. Standard schedulability analysis has been extended to consider such servers. However, not much attention has been laid on computing the worst-case delay suffered by a given stream of jobs when scheduled via a server. Such analysis is essential for using servers to schedule hard real-time tasks. We illustrate, with examples, that well established resource models, such as supply bound function and models from Real-Time Calculus, do not tightly characterize servers. In this work, we analyze the server algorithm of the Constant Bandwidth Server and compute a provably tight resource model of the server. The approach used enables us to differentiate between the soft and hard variants of the server. A similar approach can be used to characterize other servers, the final results for which are presented.
更多查看译文
关键词
processor scheduling,constant bandwidth server,earliest deadline first,general job arrivals,periodic tasks,rate monotonic,schedulability analysis,servers real-time analysis,supply bound function
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要