000 | 03380nla2a2200421 4500 | ||
---|---|---|---|
001 | 646561 | ||
005 | 20231030040733.0 | ||
035 | _a(RuTPU)RU\TPU\network\11697 | ||
035 | _aRU\TPU\network\11696 | ||
090 | _a646561 | ||
100 | _a20160303a2016 k y0engy50 ba | ||
101 | 0 | _aeng | |
105 | _ay z 100zy | ||
135 | _adrcn ---uucaa | ||
181 | 0 | _ai | |
182 | 0 | _ab | |
200 | 1 |
_aResource Allocation Algorithm Modeling in Queuing System Based on Quantization _fA. V. Raspopov, Yu. Ya. Katsman |
|
203 |
_aText _celectronic |
||
225 | 1 | _aInformation Technology, Data and Signal Processing | |
300 | _aTitle screen | ||
330 | _aThe 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 _tKey Engineering Materials _oScientific Journal |
|
463 | 0 |
_0(RuTPU)RU\TPU\network\11478 _tVol. 685 : High Technology: Research and Applications 2015 (HTRA 2015) _oThe IV International Conference, April 21-24, 2015, Tomsk, Russia _o[proceedings] _fNational Research Tomsk Polytechnic University (TPU) ; ed. N. V. Martyushev, A. M. Bogdan _v[P. 886-891] _d2016 |
|
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 |
_aRaspopov _bA. V. _cspecialist in the field of informatics and computer technology _cProgrammer of Tomsk Polytechnic University _f1992- _gAleksandr Vladimirovich _2stltpush _3(RuTPU)RU\TPU\pers\33457 |
|
701 | 1 |
_aKatsman _bYu. Ya. _cspecialist in the field of informatics and computer technology _cAssociate Professor of Tomsk Polytechnic University, candidate of technical sciences _f1948- _gYuly Yanovich _2stltpush _3(RuTPU)RU\TPU\pers\36284 |
|
712 | 0 | 2 |
_aНациональный исследовательский Томский политехнический университет (ТПУ) _bИнститут кибернетики (ИК) _bКафедра вычислительной техники (ВТ) _h126 _2stltpush _3(RuTPU)RU\TPU\col\18699 |
801 | 2 |
_aRU _b63413507 _c20160309 _gRCR |
|
856 | 4 | _uhttp://dx.doi.org/10.4028/www.scientific.net/KEM.685.886 | |
942 | _cCF |