.png){kind=icon}
返回
A semi-preemptive priority scheduling discipline: Performance analysis
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2012.08.008.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present an in-depth analytical study of a semi-preemptive priority scheduling discipline. This discipline eliminates the deficits of both the full- and non-preemptive versions. Under the non-preemptive category, in particular, higher-priority customers may have to wait even when the service of a lower-priority customer has just started, while under the full-preemptive discipline, the almost completed service of a lower-priority customer may be interrupted due to the arrival of higher-priority customers, possibly causing a large extra delay. For fixed low-priority service times, the semi-preemptive priority scheduling discipline shows a performance gain of up to 6% compared to the full- and non-preemptive versions. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Priority scheduling
(Non-)preemptive
Performance analysis
Cost function
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏Randomly interrupted GI-G-1 queues: Service strategies and stability issues随机中断的GI-G-1队列: 服务策略和稳定性问题
PREAI
分享收藏Performance analysis of non-preemptive GE/G/1 priority queueing of LER system with bulk arrivals具有批量到达的LER系统的非抢占式GE/G/1优先级排队性能分析
PREAI
分享收藏
查看更多内容