An experimental analysis of event set algorithms for discrete event simulation
(EN)
Nikolopoulos, Stavros D.
(EN)
Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικής
(EL)
Nikolopoulos, Stavros D.
(EN)
A number of event set algorithms for discrete event simulation have been selected, analysed and tested under a wide variety of conditions to estimate their average performance. A set of typical stochastic scheduling distributions has been especially chosen to show the advantages and limitations of each algorithm. The event set algorithms have been divided into four classes: (I) Linear algorithms, (II) Binary Tree algorithms: Contiguous representation, (III) Binary Tree algorithms: Linked representation and (IV) Time Mapping algorithms. Experimental analysis has been done supported by plot diagrams showing the performance of each algorithm. Tables of comparisons are also presented.
(EN)
