QUEUEING DISCIPLINES BASED ON PRIORITY MATRIX
The paper deals with queueing disciplines for demands of general type in queueing systems with multivendor load. A priority matrix is proposed to be used for the purpose of mathematical description of such disciplines, which represents the priority type (preemptive priority, not preemptive priorit...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Saint Petersburg National Research University of Information Technologies, Mechanics and Optics (ITMO University)
2014-11-01
|
Series: | Naučno-tehničeskij Vestnik Informacionnyh Tehnologij, Mehaniki i Optiki |
Subjects: | |
Online Access: | http://ntv.ifmo.ru/file/article/11195.pdf |
Summary: | The paper deals with queueing disciplines for demands of general type in queueing systems with multivendor load. A
priority matrix is proposed to be used for the purpose of mathematical description of such disciplines, which represents the
priority type (preemptive priority, not preemptive priority or no priority) between any two demands classes. Having an intuitive
and simple way of priority assignment, such description gives mathematical dependencies of system operation characteristics on
its parameters. Requirements for priority matrix construction are formulated and the notion of canonical priority matrix is given.
It is shown that not every matrix, constructed in accordance with such requirements, is correct. The notion of incorrect priority
matrix is illustrated by an example, and it is shown that such matrixes do not ensure any unambiguousness and determinacy in
design of algorithm, which realizes corresponding queueing discipline. Rules governing construction of correct matrixes are
given for canonical priority matrixes. Residence time for demands of different classes in system, which is the sum of waiting
time and service time, is considered as one of the most important characteristics. By introducing extra event method Laplace
transforms for these characteristics are obtained, and mathematical dependencies are derived on their basis for calculation of two
first moments for corresponding characteristics of demands queueing |
---|---|
ISSN: | 2226-1494 2500-0373 |