View in EDS PDF Full Text

New Polling Scheme based on Busy/Idle Queues Mechanism.

Saved in:
Bibliographic Details
Title: New Polling Scheme based on Busy/Idle Queues Mechanism.
Authors: Zhijun Yang1,2,3,4, Yangyang Sun2, Jianhou Gan1,4 ganjh@ynnu.edu.cn
Source: International Journal of Performability Engineering. Oct2018, Vol. 14 Issue 10, p2510-2519. 10p.
Subjects: Time-sharing computer systems, Polling places, Communication, Computer networks, Queuing theory, Parallel scheduling (Computer scheduling)
Abstract: Polling control system is widely used in production and life including time-sharing computer systems, industrial control, communications, and computer networks. The article proposes a new polling control system based on Busy/Idle queues, which sorts normal polling queues into Busy Queues (BQ) and Idle Queues (IQ) according to if there are customers in the queue. Then, BQ is served by a Gated access policy and IQ keeps a sleeping state until it is woken up by arriving customers. Moreover, parallel scheduling is used to save switch-over time. We build a system model using the embedded Markov chain, probability mother function, the throughput, cycle time, mean queue length and mean waiting time of significant system characteristics. Theoretical calculated values are approximately equal to the simulated values, indicating that the new system is correct and achieves a better performance than the traditional polling scheme. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Performability Engineering is the property of Totem Publisher, Inc. 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: 134544834
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: New Polling Scheme based on Busy/Idle Queues Mechanism.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Zhijun+Yang%22">Zhijun Yang</searchLink><relatesTo>1,2,3,4</relatesTo><br /><searchLink fieldCode="AR" term="%22Yangyang+Sun%22">Yangyang Sun</searchLink><relatesTo>2</relatesTo><br /><searchLink fieldCode="AR" term="%22Jianhou+Gan%22">Jianhou Gan</searchLink><relatesTo>1,4</relatesTo><i> ganjh@ynnu.edu.cn</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Performability+Engineering%22">International Journal of Performability Engineering</searchLink>. Oct2018, Vol. 14 Issue 10, p2510-2519. 10p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Time-sharing+computer+systems%22">Time-sharing computer systems</searchLink><br /><searchLink fieldCode="DE" term="%22Polling+places%22">Polling places</searchLink><br /><searchLink fieldCode="DE" term="%22Communication%22">Communication</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+networks%22">Computer networks</searchLink><br /><searchLink fieldCode="DE" term="%22Queuing+theory%22">Queuing theory</searchLink><br /><searchLink fieldCode="DE" term="%22Parallel+scheduling+%28Computer+scheduling%29%22">Parallel scheduling (Computer scheduling)</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Polling control system is widely used in production and life including time-sharing computer systems, industrial control, communications, and computer networks. The article proposes a new polling control system based on Busy/Idle queues, which sorts normal polling queues into Busy Queues (BQ) and Idle Queues (IQ) according to if there are customers in the queue. Then, BQ is served by a Gated access policy and IQ keeps a sleeping state until it is woken up by arriving customers. Moreover, parallel scheduling is used to save switch-over time. We build a system model using the embedded Markov chain, probability mother function, the throughput, cycle time, mean queue length and mean waiting time of significant system characteristics. Theoretical calculated values are approximately equal to the simulated values, indicating that the new system is correct and achieves a better performance than the traditional polling scheme. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of Performability Engineering is the property of Totem Publisher, Inc. 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=134544834
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.23940/ijpe.18.10.p28.25222531
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 10
        StartPage: 2510
    Subjects:
      – SubjectFull: Time-sharing computer systems
        Type: general
      – SubjectFull: Polling places
        Type: general
      – SubjectFull: Communication
        Type: general
      – SubjectFull: Computer networks
        Type: general
      – SubjectFull: Queuing theory
        Type: general
      – SubjectFull: Parallel scheduling (Computer scheduling)
        Type: general
    Titles:
      – TitleFull: New Polling Scheme based on Busy/Idle Queues Mechanism.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Zhijun Yang
      – PersonEntity:
          Name:
            NameFull: Yangyang Sun
      – PersonEntity:
          Name:
            NameFull: Jianhou Gan
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 10
              Text: Oct2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 09731318
          Numbering:
            – Type: volume
              Value: 14
            – Type: issue
              Value: 10
          Titles:
            – TitleFull: International Journal of Performability Engineering
              Type: main
ResultId 1