An Improved Computational Algorithm for Round-robin Service


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… (More)


8 Figures and Tables

Slides referencing similar topics