a preemptive discrete-time priority buffer system with partial buffer sharing:带有部分缓冲区共享的抢占式离散时间优先级缓冲系统.pdfVIP

a preemptive discrete-time priority buffer system with partial buffer sharing:带有部分缓冲区共享的抢占式离散时间优先级缓冲系统.pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
a preemptive discrete-time priority buffer system with partial buffer sharing:带有部分缓冲区共享的抢占式离散时间优先级缓冲系统

Applied Mathematical Modelling 34 (2010) 2148–2165 Contents lists available at ScienceDirect Applied Mathematical Modelling journal homepage: www.else /locate/apm A preemptive discrete-time priority buffer system with partial buffer sharing F. Jolai a, S.M. Asadzadeh a,*, M.R. Taghizadeh b a Department of Industrial Engineering, University College of Engineering, University of Tehran, P.O. Box 11155-4563, Iran b Department of Industrial Management, Faculty of Management, University of Tehran, P.O. Box 14155-6311, Iran a r t i c l e i n f o a b s t r a c t Article history: This paper considers a Geo/Geo/1 discrete-time queue with preemptive priority. Both the Received 28 September 2008 arrival and service processes are Bernoulli processes. There are two kinds of customers: Received in revised form 18 October 2009 low-priority and high-priority customers. The high-priority customers have a preemptive Accepted 30 October 2009 priority over low-priority customers. If the total number of customers is equal or more Available online 6 November 2009 than the threshold (k), the arrival of low-priority customers will be ignored. Hence the system buffer size is finite only for the low-priority customers. A recursive numerical Keywords: procedure is developed to find the steady-state probabilities. With the aid of recursive Discrete-time queue

您可能关注的文档

文档评论(0)

ajgoaw + 关注
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档