Please use this identifier to cite or link to this item:
Title: A study of simulation performance based on event orderings
Authors: HU YANJUN
Keywords: Parallel simulation, parallelism, event ordering, queuing network, Ethernet network, closed system.
Issue Date: 8-Mar-2004
Citation: HU YANJUN (2004-03-08). A study of simulation performance based on event orderings. ScholarBank@NUS Repository.
Abstract: A simulation protocol must adhere to a certain event ordering to produce correct simulation results. However, different event orderings exploit various degrees of parallelisms and may require different amounts of memory. We have developed a formal methodology to predict the event parallelism and memory requirement of parallel simulation based on event orderings, which was previously validated using limited queuing network benchmarks. This thesis focuses on the study and validation of this methodology with a larger and more realistic problem, Ethernet network. The experimental results reveal that in a closed system, a weaker event ordering exploits more parallelism without increasing memory usage. We observed that in the Ethernet network simulator the upper bound on memory due to event orderings is 6n-8, where n is the number of stations. Apart from assessing the cost of event orderings, the methodology can also analyze the performance of a simulation problem and the overhead of implementation.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
HuYJ.pdf434.53 kBAdobe PDF



Page view(s)

checked on Nov 4, 2018


checked on Nov 4, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.