Classical and non-classical processor sharing systems with non-homogeneous customers

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

Abstrakty

EN

We discuss a processor sharing system with non-homogeneous customers. There are resources of two types for their service: 1) resource of the first type is discrete, there are N units (servers) of the resource; 2) resource of the second type (capacity) is not-necessary discrete. The type of a customer is defined by the amount of first type resource units which is used for the customer service. Each customer is also characterized by some random capacity or some amount of the second type resource which is also used for his service. The total capacity of customers present in the system is limited by some value V >0, which is called the memory volume of the system. The customer capacity and length (the work necessary for service) are generally dependent. The joint distribution of these random variables also depends on the customer type. For such systems we determine the stationary distribution of the number of customers of each type present in the system and stationary loss probabilities for each type of customers.

Słowa kluczowe

EN

queuing; queuing system; egalitarian processor sharing; Laplace transform

PL

kolejkowanie; system kolejkowania; współdzielenie procesora egalitarne; transformata Laplace'a

• 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: 2009
• Tom: Vol. 14
• Strony: 133--150
• Opis fizyczny: Bibliogr. 13 poz.

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, A.S. Yashkova. Processor sharing: a survey of the matematical theory. Autom. Remote Control , 68 , No. 9, 1662-1731, 2007.
• [3] L. Kleinrock. Time-shared system: a theoretical treatment. J. Assoc. Comput. Mach. , 14 , No. 2, 242–251, 1967.
• [4] S.F. Yashkov. A derivation of responce time distribution for an M=G= 1 processor-sharing queue. Probl. Contr. Inf. Theory. , 12 , No. 2, 133- 148, 1983.
• [5] S.F. Yashkov. Analysis of Queues in Computers . Radio i Svyaz, Moskow, 1989. (In Russian).
• [6] S.F. Yashkov. Processor-sharing queues: some progress in analysis. Queueing Systems , 2 No 1, 1987.
• [7] S.F. Yashkov, A.S. Yashkova. Egalitarian processor sharing. Information Processes , 6 , No 4, 396-444, 2006. (In Russian).
• [8] B. Sengupta. The spatial requirement of M=G= 1 queue or: how to design for buffer space. Modeling and Performance Evaluation Method-logy , F. Baccelli and G. Fayolle (Eds.), Lect. Notes Contr. Inf. Sci., Vol. 60, pp. 547–562. Springer, Berlin 1984.
• [9] O.M. Tikhonenko. Queueing Models in Computer Systems. Universitetskoe, Minsk 1990. (In Russian).
• [10] O.M. Tikhonenko. Analysis of processor sharing system with non-homogeneous customers. Vesti NAN Belarusi, Ser. Fiz.-Mat. Navuk , No. 2, 105-111, 2008. (In Russian).
• [11] V.F. Matveev, V.G. Ushakov. Queueing Systems. Moscow State University, Moscow 1984. (In Russian).
• [12] A.A. Borovkov. Probability Theory. Editorial URSS, Moscow 1999. (In Russian).
• [13] K.W. Ross. Multiservice Loss Models for Broadband Telecommunication Networks. Springer -Verlag, London 1995.