Resource Allocation Algorithm Modeling in Queuing System Based on Quantization; Key Engineering Materials; Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015)
| Parent link: | Key Engineering Materials: Scientific Journal Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015).— 2016.— [P. 886-891] |
|---|---|
| 1. autor: | |
| Korporacja: | |
| Kolejni autorzy: | |
| Streszczenie: | Title screen The work relevance is determined by the urgent need to design and study queuing systems (QS). The selection and justification of resource management laws - the standby and service disciplines are very important here. The main aim of the study is to develop a QS simulation model with non-priority cyclic service RR (round robin) discipline, to compare the performance of the system under different control algorithm resources: RR and FCFS (first come-first served). To develop a simulation model the system of dynamic and event-driven modeling Matlab + Simulink and SimEvents libraries were used. 5 parallel processes were consistently allocated in RR time quantum algorithm. To imitate FCFS algorithm the round-robin size was set equal to 1. The testing of the developed QS model confirmed a correctness of its work. By varying the flow in the short and long (performance time) processes, it was shown that an advantage of RR algorithm over FCFS is observed, if a share of long processes is not more than 20 - 30%. Режим доступа: по договору с организацией-держателем ресурса |
| Język: | angielski |
| Wydane: |
2016
|
| Seria: | Information Technology, Data and Signal Processing |
| Hasła przedmiotowe: | |
| Dostęp online: | http://dx.doi.org/10.4028/www.scientific.net/KEM.685.886 |
| Format: | Elektroniczne Rozdział |
| KOHA link: | https://koha.lib.tpu.ru/cgi-bin/koha/opac-detail.pl?biblionumber=646561 |
MARC
| LEADER | 00000nla2a2200000 4500 | ||
|---|---|---|---|
| 001 | 646561 | ||
| 005 | 20260728170646.0 | ||
| 035 | |a (RuTPU)RU\TPU\network\11697 | ||
| 035 | |a RU\TPU\network\11696 | ||
| 090 | |a 646561 | ||
| 100 | |a 20160303a2016 k y0engy50 ba | ||
| 101 | 0 | |a eng | |
| 105 | |a y z 100zy | ||
| 135 | |a drcn ---uucaa | ||
| 181 | 0 | |a i | |
| 182 | 0 | |a b | |
| 200 | 1 | |a Resource Allocation Algorithm Modeling in Queuing System Based on Quantization |f A. V. Raspopov, Yu. Ya. Katsman | |
| 203 | |a Text |c electronic | ||
| 225 | 1 | |a Information Technology, Data and Signal Processing | |
| 300 | |a Title screen | ||
| 330 | |a The work relevance is determined by the urgent need to design and study queuing systems (QS). The selection and justification of resource management laws - the standby and service disciplines are very important here. The main aim of the study is to develop a QS simulation model with non-priority cyclic service RR (round robin) discipline, to compare the performance of the system under different control algorithm resources: RR and FCFS (first come-first served). To develop a simulation model the system of dynamic and event-driven modeling Matlab + Simulink and SimEvents libraries were used. 5 parallel processes were consistently allocated in RR time quantum algorithm. To imitate FCFS algorithm the round-robin size was set equal to 1. The testing of the developed QS model confirmed a correctness of its work. By varying the flow in the short and long (performance time) processes, it was shown that an advantage of RR algorithm over FCFS is observed, if a share of long processes is not more than 20 - 30%. | ||
| 333 | |a Режим доступа: по договору с организацией-держателем ресурса | ||
| 461 | 0 | |0 (RuTPU)RU\TPU\network\11477 |t Key Engineering Materials |o Scientific Journal | |
| 463 | 0 | |0 (RuTPU)RU\TPU\network\11478 |t Vol. 685 : High Technology: Research and Applications 2015 (HTRA 2015) |o The IV International Conference, April 21-24, 2015, Tomsk, Russia |o [proceedings] |f National Research Tomsk Polytechnic University (TPU) ; ed. N. V. Martyushev, A. M. Bogdan |v [P. 886-891] |d 2016 | |
| 610 | 1 | |a электронный ресурс | |
| 610 | 1 | |a труды учёных ТПУ | |
| 610 | 1 | |a квантование | |
| 610 | 1 | |a обслуживание | |
| 610 | 1 | |a алгоритмы | |
| 610 | 1 | |a моделирование | |
| 610 | 1 | |a очереди | |
| 610 | 1 | |a системы | |
| 700 | 1 | |a Raspopov |b A. V. |c specialist in the field of informatics and computer technology |c Programmer of Tomsk Polytechnic University |f 1992- |g Aleksandr Vladimirovich |3 (RuTPU)RU\TPU\pers\33457 | |
| 701 | 1 | |a Katsman |b Yu. Ya. |c specialist in the field of informatics and computer technology |c Associate Professor of Tomsk Polytechnic University, candidate of technical sciences |f 1948- |g Yuly Yanovich |3 (RuTPU)RU\TPU\pers\36284 | |
| 712 | 0 | 2 | |a Томский политехнический университет |b Институт кибернетики, ИК |c 2010-2017 |9 27025 |
| 801 | 2 | |a RU |b 63413507 |c 20160309 |g RCR | |
| 856 | 4 | |u http://dx.doi.org/10.4028/www.scientific.net/KEM.685.886 | |
| 942 | |c CF | ||