首页 | 本学科首页   官方微博 | 高级检索  
     检索      

非对称的多队列非抢占优先权排队系统分析
引用本文:吴云波,李志蜀,陈志华,卢暾,王莉.非对称的多队列非抢占优先权排队系统分析[J].南京理工大学学报(自然科学版),2006,30(1):53-56.
作者姓名:吴云波  李志蜀  陈志华  卢暾  王莉
作者单位:1. 四川大学,计算机学院,四川,成都,610065;浙江纺织服装学院,机电信息分院,浙江,宁波,315100
2. 四川大学,计算机学院,四川,成都,610065
3. 昆明市气象局,云南,昆明,650028
摘    要:该文对非对称情形下多队列非抢占优先权排队系统的精确解析方法进行了探讨。利用嵌入马尔可夫链理论,以服务员到达队列的时刻为参考点构造出了系统的概率母函数,从而解析出非对称情形下系统的平均周期时间以及一般队列和中心队列的平均排队队长表达式。计算机仿真实验验证了分析的有效性。

关 键 词:多站点通信  非抢占优先权排队  一阶特性  平均周期时间
文章编号:1005-9830(2006)01-0053-04
收稿时间:2004-12-27
修稿时间:2005-11-20

Exact Analysis of Asymmetric Multi-queuing System with Non-preemptive Priority
WU Yun-bo,LI Zhi-shu,CHENG Zhi-hua,LU Tun,WANG Li.Exact Analysis of Asymmetric Multi-queuing System with Non-preemptive Priority[J].Journal of Nanjing University of Science and Technology(Nature Science),2006,30(1):53-56.
Authors:WU Yun-bo  LI Zhi-shu  CHENG Zhi-hua  LU Tun  WANG Li
Institution:1. School of Computer Science, Sichuan University, Chengdu 610065, China; 2. School of Mechanical, Electronic and Information Engineering, Zhejiang Textile and Fashion College, Ningbo 315100, China; 3. Kunming Meteorological Administration, Kunming 650228, China
Abstract:This paper discusses the exact analysis of non-preemptive priority based on asymmetric multi-queuing system under exhaustive service. By setting the reference points as the moment when servers arrive at each queue, an appropriate probability generating function of the system is deduced according to the imbedded Markov chain theory. Therefore, the first moments as well as mean circle time expressions of the asymmetric system are obtained explicitly. The effectiveness of analysis is demonstrated by means of computer simulation.
Keywords:multi-access communication  non-preemptive priority queuing  first moments  mean circle time
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号