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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of simulation : JOS Jg. 3; H. 1; S. 29 - 39
Hauptverfasser:	Finley, D, Ramos, J R, Rego, V, Sang, J
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	London Taylor & Francis 01.03.2009 Palgrave Macmillan UK Taylor & Francis Ltd
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!