Bibliographic Details
| Title: |
Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts. |
| Authors: |
Kumar, B.1 drbkkumar@hotmail.com, Thanikachalam, A.1, Kanakasabapathi, V.1, Rukmani, R.2 |
| Source: |
Annals of Operations Research. Nov2016, Vol. 247 Issue 1, p319-364. 46p. |
| Subjects: |
Multiprogramming (Electronic computers), Multiprocessors, Queuing theory, Computer networks, Markov spectrum |
| Abstract: |
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. [ABSTRACT FROM AUTHOR] |
|
Copyright of Annals of Operations Research is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
