Processor sharing queueing systems with non-homogeneous customers

• Autorzy: Tikhonenko O.
• Języki publikacji: EN

Abstrakty

EN

We investigate processor sharing queueing systems with non-homogeneous customers having some random space requirements. Such systems have been used to model and solve various practical problems occurring in the design of computer or communicating systems. The above non-homogenity means that each customer (independently of others) has some random space requirement and his length (or amount of work for his service) generally depends on the space requirement. In real systems, a total sum of space requirements of customers presenting in the system is limited by some constant value (memory capacity) V > 0. We estimate loss characteristcs for such a system using queueing models with unlimited memory space.

Słowa kluczowe

EN

egalitarian processor sharing; EPS; queueing models

PL

współdzielenie procesora egalitarne; EPS; modele kolejkowe

• Wydawca: Wydawnictwo Uniwersytetu Humanistyczno-Przyrodniczego im. Jana Długosza w Częstochowie
• Czasopismo: Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
• Rocznik: 2010
• Tom: Vol. 15
• Strony: 149--162
• Opis fizyczny: Bibliogr. 10 poz., tab.

Twórcy

autor

Tikhonenko O.

• Institute of Mathematics and Computer Science Jan Długosz University in Częstochowa al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland

Bibliografia

• [1] R. Litjens, H. Van der Berg, R. J. Boucherie. Throughputs in processor sharing models for integrated stream and elastic traffic. Performance Evaluation, 65, 152-180, 2008.
• [2] S. F. Yashkov. Analysis of Queues in Computers. Radio i Svyaz, Moskow, 1989. (In Russian).
• [3] S. F. Yashkov, A. S. Yashkova. Processor sharing: a survey of the mathematical theory. Autom. Remote Control, 68 (9), 1662-1731, 2007.
• [4] L. Kleinrock. Time-shared system: a theoretical treatment. J. Assoc. Comput. Mach., 14 (2), 242-251, 1967.
• [5] V. F. Matveev, V. G. Ushakov. Queueing Systems. Moscow University, 1984. (In Russian).
• [6] D. R. Cox, W. L. Smith. Renewal Theory. Methunen, London, 1962.
• [7] O. Tikhonenko. Metody probabilistyczne analizy systemów informacyjnych. Akademicka Oficyna Wydawnicza EXIT, Warszawa, 2006.
• [8] B. Sengupta. The spatial requirement of an M/G/1 queue or: how to design for buffer space. Lect. Notes Contr. Inf. Sci., 60, 547-564, 1984.
• [9] O. M. Tikhonenko. Queueing systems with processor sharing and limited resources. Autom. Remote Control, 71 (5), 803-815, 2010.
• [10] O. Tikhonenko. Classical and non-classical processor sharing systems with non-homogeneous customers. Scientific Issues of Jan Długosz University in Częstochowa, Ser. Mathematics, XIV, 133-150, 2009.