Access Restriction

Author McCormack, William M. ♦ Sargent, Robert G.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Time flow mechanisms ♦ Simulation event set ♦ Data structures
Abstract New analytical and empirical results for the performance of future event set algorithms in discrete event simulation are presented. These results provide a clear insight to the factors affecting algorithm performance, permit evaluation of the hold model, and determine the best algorithm(s) to use. The analytical results include a classification of distributions for efficient insertion scanning of a linear structure. In addition, it is shown that when more than one distribution is present, there is generally an increase in the probability that new insertions will have smaller times than those in the future event set. Twelve algorithms, including most of those recently proposed, were empirically evaluated using primarily simulation models. Of the twelve tested, four performed well, three performed fairly, and five performed poorly.
Description Affiliation: Syracuse Univ., Syracuse, NY (Sargent, Robert G.) || Virginia Polytechnic Institute, Blacksburg (McCormack, William M.)
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 24
Issue Number 12
Page Count 12
Starting Page 801
Ending Page 812

Open content in new tab

   Open content in new tab
Source: ACM Digital Library