Thumbnail
Access Restriction
Subscribed

Author Elmaghraby, Adel S. ♦ Soliman, Hussam M.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract One approach to speed up a discrete-event simulation program is to parallelize the execution of events in a pregenerated traditional simulation event list on a shared-memory multiprocessor. The input to the parallel-event simulator consists of a series of event lists, corresponding to different simulation runs, which are organized in the form of state-dependency graphs with random structures. Each graph is divided into a number of dependency levels which are executed in sequence by the multiprocessor.In this paper, we develop an analytical model for the performance of the parallel-event simulator. In particular, a closed form expression is given for a lower bound on the average response time of a simulation run. Performance is also estimated by simulating the parallel-event simulator. Performance results indicate that, for simulation problems whose event lists contain enough parallelism, the parallel-event simulator is capable of achieving good performance.
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1990-12-01
Publisher Place New York
Journal ACM SIGSIM Simulation Digest (SIML)
Volume Number 24
Issue Number 3
Page Count 19
Starting Page 21
Ending Page 39


Open content in new tab

   Open content in new tab
Source: ACM Digital Library