IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v3y2009i1p29-39.html
   My bibliography  Save this article

A fast computational algorithm for simulating round-robin service

Author

Listed:
  • D Finley
  • J R Ramos
  • V Rego
  • J Sang

Abstract

An efficient computation-based algorithm for effecting round-robin (RR) service in discrete-event simulation systems is presented. The new algorithm improves upon an older computational algorithm which itself is an improvement over naive RR scheduling currently in use in process-oriented simulation systems. The naive approach can be prohibitively expensive due to process context switch overhead. The original computational algorithm avoids much of this context switching but offers a run-time complexity of only O(n2), where n is the size of the job pool. This is because the processing of each arrival and departure event requires a traversal of the entire pool. In this paper, we propose an improved algorithm which reduces run-time complexity to O(n log n) by using tree-based data structures. The expected computation to process each arrival or departure event is proportional to O(log n). Empirical evidence suggests that, except for very small size of job pool, this algorithm is considerably faster than other methods.

Suggested Citation

  • D Finley & J R Ramos & V Rego & J Sang, 2009. "A fast computational algorithm for simulating round-robin service," Journal of Simulation, Taylor & Francis Journals, vol. 3(1), pages 29-39, March.
    • Handle: RePEc:taf:tjsmxx:v:3:y:2009:i:1:p:29-39
    DOI: 10.1057/jos.2008.10
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/jos.2008.10
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jos.2008.10?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tjsmxx:v:3:y:2009:i:1:p:29-39. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.