Thumbnail
Access Restriction
Subscribed

Author Vaucher, Jean G. ♦ Duval, Pierre
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Time flow mechanism ♦ Event scheduling routine ♦ Simulation ♦ Event list algorithm ♦ Discrete system simulation ♦ Simulation executive ♦ Sorting
Abstract Four algorithms are considered which can be used to schedule events in a general purpose discrete simulation system. Two of the algorithms are new, one is based on an end-order tree structure for event notices, and another uses an indexed linear list. The algorithms are tested with a set of typical stochastic scheduling distributions especially chosen to show the advantages and limitations of the algorithms. The end-order tree algorithm is shown to be an advantageous, immediate replacement for the algorithm in use with current simulation languages. The most promising algorithm uses the indexed list concept. It will require an adaptive routine before it can be employed in general purpose simulators, but its performance is such that further study would be fruitful.
Description Affiliation: Univ. de Montréal, Montréal, Québec, Canada (Vaucher, Jean G.; Duval, Pierre)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 18
Issue Number 4
Page Count 8
Starting Page 223
Ending Page 230


Open content in new tab

   Open content in new tab
Source: ACM Digital Library