$M/G/1/./EDF$ system. Existing models on ED'/> Performance Analysis of EDF Scheduling in a Multi-Priority Preemptive M/G/1 Queue
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Performance Analysis of EDF Scheduling in a Multi-Priority Preemptive M/G/1 Queue
【24h】

Performance Analysis of EDF Scheduling in a Multi-Priority Preemptive M/G/1 Queue

机译：多优先级可抢占M / G / 1队列中EDF调度的性能分析

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper presents a queueing theoretic performance model for a multipriority preemptive $M/G/1/./EDF$ system. Existing models on EDF scheduling consider them to be $M/M/1$ queues or nonpreemptive $M/G/1$ queues. The proposed model approximates the mean waiting time for a given class based on the higher and lower priority tasks receiving service prior to the target and the mean residual service time experienced. Additional time caused by preemptions is estimated as part of mean request completion time for a given class and as part of the mean delay experienced due to jobs in execution, on an arrival. The model is evaluated analytically and by simulation. Results confirm its accuracy, with the difference being a factor of two on average in high loads. Comparisons with other algorithms (such as First-Come-First-Served, Round-Robin and Nonpreemptive Priority Ordered) reveal that EDF achieves a better balance among priority classes where high priority requests are favored while preventing lower priority requests from overstarvation. EDF achieves best waiting times for higher priorities in lower to moderate loads (0.2-0.6) and while only being 6.5 times more than static priority algorithms in high loads (0.9). However, for the lowest priority classes, it achieves comparable waiting times to Round-Robin and First-Come-First-Served in low to moderate loads and achieves waiting times only twice the amount of Round-Robin in high system loads.
机译：本文提出了一种多优先级的抢先式 $ M / G / 1 /./ EDF $ 系统的排队理论性能模型。现有的EDF调度模型认为它们是 $ M / M / 1 $ 队列或非抢占式 $ M / G / 1 $ 队列。所提出的模型基于在目标之前接收服务的较高优先级任务和较低优先级任务以及经历的平均剩余服务时间来估计给定类的平均等待时间。抢占所导致的额外时间被估计为给定类的平均请求完成时间的一部分，以及到达时由于执行作业而经历的平均延迟的一部分。通过分析和仿真评估模型。结果证实了其准确性，在高负载下，差异平均为两倍。与其他算法（例如“先来先服务”，“循环优先”和“非抢先优先顺序”）的比较显示，EDF在优先级类别之间实现了更好的平衡，在优先级类别中，优先级较高的请求得到了支持，同时防止了优先级较低的请求因过度使用而显得过分紧张。在中低负载（0.2-0.6）下，EDF可获得较高优先级的最佳等待时间，而在高负载（0.9）下，EDF仅是静态优先级算法的6.5倍。但是，对于最低优先级的类别，它在中低负载下的轮转时间和“按先来先服务”可比，而在高系统负载下的轮流时间仅为轮循量的两倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号