Menu
Publications
2024
2023
2022
2021
2020
2019
2018
2017
2016
2015
2014
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
Editor-in-Chief
Nikiforov
Vladimir O.
D.Sc., Prof.
Partners
doi: 10.17586/2226-1494-2015-15-2-356-358
COMPACT REPRESENTATION OF THE PRIORITY MATRIX WITH HIGH DIMENSIONALITY
Read the full article
';
Article in Russian
For citation: Aliev T.I. Compact representation of the priority matrix with high dimensionality. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2015, vol.15, no. 2, pp. 356–358.
Abstract
For citation: Aliev T.I. Compact representation of the priority matrix with high dimensionality. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2015, vol.15, no. 2, pp. 356–358.
Abstract
We propose methods for compact representation of priority matrix with high dimensionality, which is used to describe priority queueing disciplines of demands in systems with nonhomogeneous load. This considerably decreases dimensionality of the priority matrix in comparison with original values in case that the number of classes of demands, entering the system, is large. Two methods for compact representation of priority matrix are considered: for canonical and non-canonical original matrix. It is shown that there is one-to-one correspondence between priority matrix and its compact representation. Mathematical expressions are derived for forward and backward recalculation of elements of original priority matrix into its compact representation. Rules governing the construction of correct matrixes are given for canonical and noncanonical priority matrixes.
Keywords: queueing discipline, priority matrix, canonical priority matrix, compact priority matrix.
References
References
1. Aliev T.I., Nikulsky I.Y., Pyattaev V.O. Modeling of packet switching network with relative prioritization for different traffic types. Proc. 10th Int. Conf. on Advanced Communication Technology, ICACT-2008. Phoenix Park, South Korea, 2008, art. 4494220, pp. 2174–2176. doi: 10.1109/ICACT.2008.4494220
2. Muravyeva-Vitkovskaya L.A. Obespechenie kachestva obsluzhivaniya v mul'tiservisnykh komp'yuternykh setyakh za schet prioritetnogo upravleniya [Priority-based mechanisms of service quality provision in multiservice computer networks]. Izv. vuzov. Priborostroenie, 2012, vol. 55, no. 10, pp. 64–68.
3. Aliev T.I. Osnovy Modelirovaniya Diskretnykh System [Fundamentals of Simulation of Discrete Systems]. St. Petersburg, SPbSU ITMO Publ., 2009, 363 p.
4. Ryzhikov Yu.I. Srednie vremena ozhidaniya i prebyvaniya v mnogokanal'nykh prioritetnykh sistemakh [Mean waiting and sojourn times in multichannel priority systems]. Informatsionno-Upravlyayushchie Sistemy, 2006, no. 6, pp. 43–49.
5. Alfa A.S. Matrix-geometric solution of discrete time MAP/PH/1 priority queue. Naval Research Logistics, 1998, vol. 45, no. 1, pp. 23–50.
6. Osnovy Teorii Vychislitel'nykh Sistem [Foundations of the Theory of Computing Systems]. Ed. S.A. Maiorov. Moscow, Vysshaya Shkola Publ., 1978, 408 p.
7. Aliev T.I., Maharevs E. Queueing disciplines based on priority matrix. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2014, no. 6 (94), pp. 91–97.
8. Aliev T.I. Proektirovanie sistem s prioritetami [Design of systems with priorities]. Izv. vuzov. Priborostroenie, 2014, vol. 57, no. 4, pp. 30–35.
