Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
