Performance analysis of a multiprogramming–multiprocessor retrial queueing system with orderly reattempts
| Autor: | R. Rukmani, A. Thanikachalam, V. Kanakasabapathi, B. Krishna Kumar |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Queueing theory
021103 operations research Computer science Real-time computing Control (management) 0211 other engineering and technologies General Decision Sciences Markov process Multiprocessing 010103 numerical & computational mathematics 02 engineering and technology Management Science and Operations Research 01 natural sciences symbols.namesake symbols Applied mathematics Computer multitasking 0101 mathematics Orbit (control theory) |
| Zdroj: | Annals of Operations Research. 247:319-364 |
| ISSN: | 1572-9338 0254-5330 |
| DOI: | 10.1007/s10479-015-2005-3 |
| Popis: | This paper deals with retrial queueing models having an unlimited/a finite orbit capacity with control retrial policy of a multiprogramming–multiprocessor computer network system. Under the Markovian assumptions and light-traffic condition, the steady-state probabilities of the number of programs in the system and the mean number of programs in the orbit are studied using matrix geometric/analytic methods. The expressions for the Laplace-Stieglitz transforms of the busy period and the waiting time are obtained. The probability generating function for the number of retrials made by a tagged program is also derived. Some interesting performance measures of the system and the various moments of quantities of interest are discussed. Finally, extensive numerical results are illustrated to reveal the impact of the system parameters on the performance measures. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink