skip to main content
10.5555/1030818.1030914acmconferencesArticle/Chapter ViewAbstractPublication PageswscConference Proceedingsconference-collections
Article

Simulation of large scale networks III: an improved computational algorithm for round-robin service

Published:07 December 2003Publication History

ABSTRACT

We present an efficient algorithm for effecting round-robin service in discrete-event simulation systems. The approach generalizes and improves upon a previous approach in which a single arrival and a single departure event is considered and handled at a time; further, the previous approach is already an improvement over naive round-robin scheduling currently in use in simulation libraries. The prior proposal offered a run-time complexity of <i>O(n</i><sup>2</sup>), because the processing of each event required an entire traversal of the job pool. We propose a generalized algorithm which includes the previous case and also accommodates burst arrivals and batch departures, further reducing run-time complexity to <i>O (n</i> log <i>n</i>). This is achieved through a detailed but efficient computation of multiple departure times, while simultaneously obviating the need for a job pool update with each departure. Empirical results are presented to compare performance with previously proposed algorithms.

References

  1. Cormen, T., C. Leiserson, R. Rives, and C. Stein. 2001. Introduction to Algorithms, Chapter 14: Augmenting Data Structures. 2d ed. Boston, MA: McGraw-Hill. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Fishman, G. S. 2001. Discrete-Event Simulation. New York: Springer-Verlag. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Law, A. and W. D. Kelton. 2000. Simulation Modeling and Analysis. 3d ed. Boston, MA: McGraw-Hill. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Mascarenhas, E. and V. Rego. 1996. Ariadne: Architecture of a Portable Threads system supporting Thread Migration. Software - Practice and Experience 26(3):327--357.Google ScholarGoogle ScholarCross RefCross Ref
  5. McHaney, R. 1991. Computer Simulation: A practical perspective. San Diego, CA: Academic Press. 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Sang, J., K. Chung, and V. Rego. 1994. Efficient algorithms for simulating service disciplines. Simulation Practice & Theory 1:223--244. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Schwetman, H. D. 1988. Using CSIM to model complex systems. In Proceedings of the 1988 Winter Simulation Conference, ed. M. Abrams, P. Haigh, and J. Comfort, 246 - 253. Piscataway, New Jersey: Institute of Electrical and Electronics Engineers. Google ScholarGoogle ScholarDigital LibraryDigital Library

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    WSC '03: Proceedings of the 35th conference on Winter simulation: driving innovation
    December 2003
    2094 pages
    ISBN:0780381327

    Publisher

    Winter Simulation Conference

    Publication History

    • Published: 7 December 2003

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    WSC '03 Paper Acceptance Rate128of189submissions,68%Overall Acceptance Rate3,413of5,075submissions,67%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader