View in EDS PDF Full Text

Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts.

Saved in:
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
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 119309361
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kumar%2C+B%2E%22">Kumar, B.</searchLink><relatesTo>1</relatesTo><i> drbkkumar@hotmail.com</i><br /><searchLink fieldCode="AR" term="%22Thanikachalam%2C+A%2E%22">Thanikachalam, A.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Kanakasabapathi%2C+V%2E%22">Kanakasabapathi, V.</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Rukmani%2C+R%2E%22">Rukmani, R.</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Annals+of+Operations+Research%22">Annals of Operations Research</searchLink>. Nov2016, Vol. 247 Issue 1, p319-364. 46p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Multiprogramming+%28Electronic+computers%29%22">Multiprogramming (Electronic computers)</searchLink><br /><searchLink fieldCode="DE" term="%22Multiprocessors%22">Multiprocessors</searchLink><br /><searchLink fieldCode="DE" term="%22Queuing+theory%22">Queuing theory</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+networks%22">Computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22Markov+spectrum%22">Markov spectrum</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: 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]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>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.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=119309361
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s10479-015-2005-3
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 46
        StartPage: 319
    Subjects:
      – SubjectFull: Multiprogramming (Electronic computers)
        Type: general
      – SubjectFull: Multiprocessors
        Type: general
      – SubjectFull: Queuing theory
        Type: general
      – SubjectFull: Computer networks
        Type: general
      – SubjectFull: Markov spectrum
        Type: general
    Titles:
      – TitleFull: Performance analysis of a multiprogramming-multiprocessor retrial queueing system with orderly reattempts.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kumar, B.
      – PersonEntity:
          Name:
            NameFull: Thanikachalam, A.
      – PersonEntity:
          Name:
            NameFull: Kanakasabapathi, V.
      – PersonEntity:
          Name:
            NameFull: Rukmani, R.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 07
              M: 11
              Text: Nov2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 02545330
          Numbering:
            – Type: volume
              Value: 247
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Annals of Operations Research
              Type: main
ResultId 1