Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
429 6 |
Ultima descărcare din IBN: 2023-10-02 23:38 |
Căutarea după subiecte similare conform CZU |
004.4+519.6 (1) |
Software (296) |
Computational mathematics. Numerical analysis (123) |
SM ISO690:2012 LEFEBVRE, Mario. On a modified M/M/m/n queueing model. In: Computer Science Journal of Moldova, 2021, nr. 1(85), pp. 29-40. ISSN 1561-4042. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Computer Science Journal of Moldova | ||||||
Numărul 1(85) / 2021 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
CZU: 004.4+519.6 | ||||||
MSC 2010: 68M20, 60K25, 60K30, 90B22. | ||||||
Pag. 29-40 | ||||||
|
||||||
Descarcă PDF | ||||||
Rezumat | ||||||
The classic M/M/m/n queueing model is modified by allowing a given task to require up to m servers to be performed. Moreover, the maximum time that a task can wait in the queue before being executed is a random variable having an exponential distribution. Both FIFO (First In, First Out) and priority disciplines are considered. The case when m = 2 is treated: the state space needed to fully describe the system is given, its size is calculated and the balance equations are presented when n = 1, 2 and 3. The queueing process can be used to model cluster-type multiprocessor computing systems. |
||||||
Cuvinte-cheie State space, balance equations, queue discipline, priority, cluster-type multiprocessor computing systems |
||||||
|