Thumbnail
Access Restriction
Subscribed

Author Wyman, F. Paul
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Event scanning mechanisms ♦ Simulation ♦ Discrete event simulation
Abstract Simulation models of large, complex “real-world” applications have occasionally earned the reputation of eating up hours of computer time. This problem may be attributed in part to difficulties such as slow stochastic convergence. However, an additional problem lies in the fact that a significant amount of bookkeeping time is required to keep future events in their proper sequence. This paper presents a method for significantly reducing the time spent scanning future events lists in discrete event simulations. Three models are presented, all of which improve in effectiveness as the events-list scan problem becomes more burdensome.
Description Affiliation: Bechtel Incorporated, San Francisco, CA (Wyman, F. Paul)
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 6
Page Count 4
Starting Page 350
Ending Page 353


Open content in new tab

   Open content in new tab
Source: ACM Digital Library