On Schedulability Bounds of Weighted Round Robin Schedulers

msra(2006)

引用 23|浏览15
暂无评分
摘要
We derive a closed-formed schedulability bound for weighted round robin schedulers. The schedulability bound is parameterized for protocol overhead ratio α which measures the portion of time consumed in protocol operations per round, normalized token rotation frequency γ which measures the number of token rotations per Dmin (the shortest relative deadline of the tasks) time interval, the normalized deadline k , which measures the tightness of deadline assignment, the tasks set workload smoothness µ which measures the burstness of the workload. Individual schedulability bounds can be easily obtained by simply plugging in these parameters.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要