Resource Allocation Algorithm Modeling in Queuing System Based on Quantization

Alexander Raspopov; Yu.Ya. Katsman

doi:10.4028/www.scientific.net/KEM.685.886

Paper Titles

Distributed Information System for Processing and Storage of Meteorological Data
p.867

Content-Based Image Retrieval Using Color, Texture and Shape Features
p.872

Source Code Analysis: Current and Future Trends & Challenges
p.877

Software Traceability – A Key to Improve Software Evolution
p.881

Resource Allocation Algorithm Modeling in Queuing System Based on Quantization
p.886

Flexible Process Model Design
p.892

Fast Search for Intra Prediction Mode in H.265/HEVC Video Compression
p.897

Algorithm of the Alternatives Generation in the Design of the Geological and Engineering Operations
p.902

Development of the Decision-Making Algorithm on the Geological and Engineering Operations Based on the Infrastructure of the Digital Oil Field
p.907

HomeKey Engineering MaterialsKey Engineering Materials Vol. 685Resource Allocation Algorithm Modeling in Queuing...

Resource Allocation Algorithm Modeling in Queuing System Based on Quantization

Abstract:

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%.

You might also be interested in these eBooks

High Technology: Research and Applications 2015

View Preview

Info:

Periodical:

Key Engineering Materials (Volume 685)

Pages:

886-891

DOI:

https://doi.org/10.4028/www.scientific.net/KEM.685.886

Citation:

Cite this paper

Online since:

February 2016

Authors:

Alexander Raspopov, Yu.Ya. Katsman*

Keywords:

Circular Round Robin, CPU (Central Processing Unit), FCFS (First Come - First Served), Model, Priority-Free Discipline of Expectation, Priority-Free Discipline of Service, Queue, Queueing System

Export:

RIS, BibTeX

Price:

Permissions:

Request Permissions

* - Corresponding Author

References

[1] K.N. Apachidi, Modelirovanie sistem massovogo obsluzhivaniya s prioritetnymi distsiplinami obsluzhivaniya, Proceedings of the Conference Prospects of Development Of Information Technologies, (2014) 5-6. [in Russian].

Google Scholar

[2] J.J. Katsman, K.N. Apachidi, Algorithm Simulation of Resource Allocation of the Queueing Systems Based on the Priorities, International Conference on Mechanical Engineering Automation and Control Systems (MEACS), (2014) 1-6.

DOI: 10.1109/meacs.2014.6986896

Google Scholar

[3] A. V. Raspopov, Realizatsiya distsipliny raspredeleniya resursov po krugovomu tsiklicheskomu algoritmu sredstvami SIMULINK, Proceedings of Scientific School Information systems and technologies in education, science and business (ISiT-2014), (2014).

Google Scholar

[4] Shahram Saeidi, H. Alemi Baktash, Determining the Optimum Time Quantum Value in Round Robin Process Scheduling Method, I.J. I.T. and Computer Science, 10 (2012) 67-73.

DOI: 10.5815/ijitcs.2012.10.08

Google Scholar

[5] Paul Krzyzanowski, Process Scheduling, Information on http: /www. cs. rutgers. edu/~pxk/416/notes/07-scheduling. html, (2015).

Google Scholar