ACM Home Page
Please provide us with feedback. Feedback
Simulation of large scale networks III: an improved computational algorithm for round-robin service
Full text PdfPdf (159 KB)
Source Winter Simulation Conference archive
Proceedings of the 35th conference on Winter simulation: driving innovation table of contents
New Orleans, Louisiana
SESSION: Modeling methodology a table of contents
Pages: 721 - 728  
Year of Publication: 2003
ISBN:0-7803-8132-7
Authors
Jorge R. Ramos  Purdue University, West Lafayette, IN
Vernon Rego  Purdue University, West Lafayette, IN
Janche Sang  Cleveland State University, Cleveland, OH
Sponsors
INFORMS/CS : Institute for Operations Research and the Management Sciences/College on Simulation
NIST : National Institute of Standards and Technology
IEEE/SMCS : Institute of Electrical and Electronics Engineers/Systems, Man, and Cybernetics Society
ACM: Association for Computing Machinery
(SCS) : The Society for Modeling and Simulation International
SIGSIM: ACM Special Interest Group on Simulation and Modeling
IIE : Institute of Industrial Engineers
IEEE/CS : Institute of Electrical and Electronics Engineers/Computer Society
ASA : American Statistical Association
Publisher
Winter Simulation Conference 
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Citation Count: 1
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

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.



Collaborative Colleagues:
Jorge R. Ramos: colleagues
Vernon Rego: colleagues
Janche Sang: colleagues