A fast computational algorithm for simulating round-robin service

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of simulation : JOS Vol. 3; no. 1; pp. 29 - 39
Main Authors: Finley, D, Ramos, J R, Rego, V, Sang, J
Format: Journal Article
Language:English
Published: London Taylor & Francis 01.03.2009
Palgrave Macmillan UK
Taylor & Francis Ltd
Subjects:
Algorithms
augmented red-black tree
Business and Management
discrete-event simulation
Information Systems and Communication Service
Operations Research/Decision Theory
process-oriented simulation
round-robin scheduling
Schedules
Simulation
Simulation and Modeling
round-robin scheduling
augmented red-black tree
discrete-event simulation
process-oriented simulation
ISSN:1747-7778, 1747-7786
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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(n 2 ), 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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:1747-7778
1747-7786
DOI:10.1057/jos.2008.10