首页> 外文会议>International Conference on Computer Science and Engineering >Analysis of Priorities Queuing Model (N-P) System With Multiple Channel Multiple Phase and Simple Additive Weighting
【24h】

Analysis of Priorities Queuing Model (N-P) System With Multiple Channel Multiple Phase and Simple Additive Weighting

机译:多通道多相和简单加权的优先级排队模型(N-P)系统分析

获取原文

摘要

The queue is a situation where people/goods must wait to get a turn of service. This happens because the number of arrivals is greater than the number of services. Generally, there are 4 queuing methods, namely FIFO (First In First Out), FILO (First In Last Out), SIRO(Services in random order), and PS (Priority Services). In this research, the authors conducted priority queues based on weighting using the SAW algorithm. Queue modeling uses Multiple channel Multiple Phase, where there are 2 phases that will be passed on the queue system. In phase 1, an assessment will be made using the SAW algorithm to produce weights value for each queue. Then in phase 2, a call will be made based on the priority value. In the priority queue, the queue can get service faster or slower according to the queue category. Tests are carried out following (M/M/1:GD/∞/∞) dan (M/M/3:PS/∞/∞) modeling with 100 test data with random variables. In this queue model, the arrival distribution follows a Poisson distribution, and the service distribution follows an exponential distribution. After testing, the results of the queue were obtained: 15,3% effective in the low category, 65% effective in the normal category, 100% effective in the medium category, 100% effective in the high category. From the results it can be concluded that the queue system is effective in the queue with Normal, Medium and High categories. Queues will not effective in low category.
机译:队列是人/商品必须等待进行服务的情况。这发生是因为到达数量大于服务数量。通常,有4种排队方法,即FIFO(首先排在第一个),FILO(首先终止),Siro(以随机顺序的服务)和PS(优先级服务)。在这项研究中,作者基于使用SAW算法的加权进行了优先级队列。队列建模使用多个通道多个阶段,其中有2个阶段将在队列系统上传递。在阶段1中,将使用SAW算法进行评估,为每个队列产生权重值。然后在阶段2中,将基于优先级值进行呼叫。在优先级队列中,队列可以根据队列类别更快或更慢地获得服务。测试进行以下(M / m / 1:gd /∞/∞)丹(m / m / 3:ps /∞/∞),其建模为100个测试数据,其中包含随机变量。在该队列模型中,到达分布遵循泊松分布,服务分配遵循指数分布。测试后,获得队列的结果:15,3%在低类别中有效,65%有效在正常类别,100%效率在中等类别,100%效率在高类别中有效。从结果中可以得出结论,队列系统在具有正常,中等和高类的队列中有效。队列在低类别中不会有效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号