Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10789
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNikolopoulos, Stavros D.en
dc.contributor.authorMacLeod, Rodericken
dc.date.accessioned2015-11-24T17:00:36Z-
dc.date.available2015-11-24T17:00:36Z-
dc.identifier.issn0165-6074-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10789-
dc.rightsDefault Licence-
dc.subjectDiscrete simulationen
dc.subjectevent set algorithmsen
dc.subjecttime flow mechanismsen
dc.subjectdata structuresen
dc.titleAn experimental analysis of event set algorithms for discrete event simulationen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.primary10.1016/0165-6074(93)90248-j-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate1993-
heal.abstractA 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
heal.journalNameMicroprocessing and Microprogrammingen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)



This item is licensed under a Creative Commons License Creative Commons