引用本文:范 中,郑应平.M1十M2/M/I/k系统输入队列调度算法性能比较[J].控制理论与应用,1998,15(5):656~662.[点击复制]
FANZhong and ZHENGYingpting.Comparison of Input Buffer Scheduling Algorithms in Mi + M2 / M/l/k System*[J].Control Theory and Technology,1998,15(5):656~662.[点击复制]
M1十M2/M/I/k系统输入队列调度算法性能比较
Comparison of Input Buffer Scheduling Algorithms in Mi + M2 / M/l/k System*
摘要点击 1001  全文点击 494  投稿时间:1996-09-10  修订日期:1997-05-09
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  
  1998,15(5):656-662
中文关键词  排队系统  优先级  缓冲器  调度算法
英文关键词  排队系统  优先级  缓冲器  调度算法
基金项目  
作者单位
范 中,郑应平  
中文摘要
      排队系统中优先级的划分方法主要有空间优先和时间优先两种类型,本文针对时间优先级系统进行分析,通过对缓冲器完全共享,缓冲器部分共享和分离缓冲器等三种缓冲器调度控制算法的分析比较,我们可以看出,分离缓冲器调度算法能够有效地减少实时性顾客的失效概率,获得满意的控制效果,并且其实现的复杂度也较低.
英文摘要
      Space priority and time priority are two categories in priority queueing systems. ln the paper,we focused on time priority,and analyzed some buffer scheduling algorithms such as buffer sharing,partial buffer sharing,and buffer separation. ln the result,we find that buffer sepa-ration can effectively decrease the expiration probability of real-time customers with low realization complexity.