this article advocates the use of a formal framework for analyzing simulation performance. simulation performance is characterized based on the three simulation development process boundaries: physical system, simulat...
详细信息
this article advocates the use of a formal framework for analyzing simulation performance. simulation performance is characterized based on the three simulation development process boundaries: physical system, simulation model, and simulator implementation. First, the authors formalize simulation event ordering using partially ordered set theory. A simulator implements a simulation event ordering and incurs implementation overheads when enforcing event ordering at runtime. Second, they apply their formalism to extract and formalize the simulation event orderings of both sequential and parallelsimulations. third, they propose the relation stricter and a measure called strictness for comparing and quantifying the degree of event dependency of simulation event orderings, respectively. In contrast to the event parallelism measure, strictness is independent of time.
Withparallel and Discrete Event simulation (PDES) techniques, the runtime performance of detailed wireless network simulation can be improved significantly without compromising fidelity of the simulation results. How...
详细信息
ISBN:
(纸本)0769521118
Withparallel and Discrete Event simulation (PDES) techniques, the runtime performance of detailed wireless network simulation can be improved significantly without compromising fidelity of the simulation results. However modelling characteristics of wireless communications such as signal propagation and interference may severely hinder the potential speedup yielded by PDES. this paper proposes various optimization techniques to address three major concerns in achieving efficient parallel execution of wireless network simulation: i.e., (1) reducing communication and computation overhead of simulating signal propagation across multiple logical processes;(2) reducing synchronization overhead among logical processes;(3) minimizing event scheduling overhead within individual logical processes. these techniques have been implemented in a parallel version of GloMoSim and QualNet. the experimental results with mobile ad hoc networking scenarios demonstrate that the proposed optimization techniques can improve the performance of parallel wireless network simulation by up to an order of magnitude.
Withthe wide use of commercial off-the-shelf (COTS) simulation packages and the advent of the High Level Architecture (HLA) standard, it is desirable to build distributedsimulations by linking various types of simul...
详细信息
Withthe wide use of commercial off-the-shelf (COTS) simulation packages and the advent of the High Level Architecture (HLA) standard, it is desirable to build distributedsimulations by linking various types of simulation models developed using best-fit COTS packages. While almost all current work on integrating COTS packages and the HLA is based on conservative synchronization, it is worthwhile to investigate the optimistic synchronization approach. the optimistic approach can exploit parallelism and achieve promising performance in situations where causality errors may occur but in fact seldom occur. the authors introduce a rollback controller using a middleware approach to handle the complex rollback procedure on behalf of the simulation model. A new time advance algorithm is proposed that can fully use the benefits of optimistic synchronization. the article also describes a scalability study showing the experimental results for the two synchronization approaches as the number of simulation components increases.
the authors study the adaptation of an optimistic Time Warp kernel to cross-cluster computing on the Grid. Wide-area communication, the primary source of overhead, is offloaded onto dedicated routing processes. this a...
详细信息
the authors study the adaptation of an optimistic Time Warp kernel to cross-cluster computing on the Grid. Wide-area communication, the primary source of overhead, is offloaded onto dedicated routing processes. this allows the simulation processes to run at full speed and thus significantly decreases the performance gap caused by the wide-area distribution. Further improvements are obtained by employing message aggregation on the wide-area links and using a distributed global virtual time algorithm. the authors achieve many of their objectives for a cellular automaton simulation with lazy cancellation and moderate communication. High communication rates, especially with aggressive cancellation, present a challenge. this is confirmed by the experiments with synthetic loads. Even then, a satisfactory speedup can be achieved, provided that the computational grain of events is large enough.
Time-parallelsimulation offers the potential of massive parallelization of a simulation application, due to the amount of achievable parallelism not being restricted by the decomposability of the state space of a sim...
详细信息
ISBN:
(纸本)0769521118
Time-parallelsimulation offers the potential of massive parallelization of a simulation application, due to the amount of achievable parallelism not being restricted by the decomposability of the state space of a simulation model. Unfortunately, the potential speedup of a time-parallelsimulation highly depends on the ability to match final and initial states of adjacent time intervals. Depending on the properties of the underlying simulation model, it might be feasible to accept a simulation iteration, even if the states of adjacent time intervals do not match exactly. this leads to the concept of approximative state matching in time-parallelsimulation, which is introduced in this paper Experiments with a prototypical implementation of a simple simulation model show encouraging results in terms of simulation speedup and introduced error.
the authors discuss an approach to federated network simulations that eases the burdens on the simulation developer in creating space-parallelsimulations. Previous approaches have had difficulties that arise from the...
详细信息
the authors discuss an approach to federated network simulations that eases the burdens on the simulation developer in creating space-parallelsimulations. Previous approaches have had difficulties that arise from the need for global topology knowledge when forwarding simulated packets between federates. In all but the simplest cases, proper packet-forwarding decisions between federates requires routing tables of size O(mn), where m is the number of nodes modeled in a particular federate, and n is the total number of network nodes in the entire topology. Furthermore, the benefits of the well-known NIx-Vector routing approach cannot be fully achieved without global knowledge of the overall topology. the authors overcome these difficulties by using a topology partitioning methodology that uses ghost nodes. they show experimentally that the memory overhead associated with ghosts is minimal relative to the overall memory footprint of the simulation.
In optimistic simulations, checkpointing techniques are often used to reduce the overhead caused by state saving. In this paper, we propose event reconstruction as a technique with which to reduce the overhead caused ...
详细信息
ISBN:
(纸本)0769521118
In optimistic simulations, checkpointing techniques are often used to reduce the overhead caused by state saving. In this paper, we propose event reconstruction as a technique with which to reduce the overhead caused by event saving, and compare its memory consumption and execution time to the results obtained by dynamic checkpointing. As the name implies, event reconstruction reconstructs input events and anti-events from the differences between adjacent states, and does not save input events in the event queue. For simulations with fine event granularity and small state size, such as the logic simulation of VLSI circuitry, event reconstruction can yield an improvement in execution time as well as a significant reduction in memory utilization when compared to dynamic checkpointing. Moreover, this technique facilitates load migration because only the state queue needs to be moved from one processor to another.
parallelsimulation and distributedsimulation sometimes appear to be two different worlds. Where parallelsimulation aims at increasing the speed of a single model by distributing it over more processors, distributed...
详细信息
ISBN:
(纸本)0769521118
parallelsimulation and distributedsimulation sometimes appear to be two different worlds. Where parallelsimulation aims at increasing the speed of a single model by distributing it over more processors, distributedsimulation looks at ways to link entire models or federates that run on different computers. In the case of distributedsimulation, the models themselves are hard to distribute, and often they each run on one processor as a monolithic model. this paper advocates to build the more traditional simulation models in such a way, that they can be easily distributed. As simulationists, we can learn from component-based theory from the software engineering field to prepare our models for distribution, and parts of our models for reuse. the results of several projects show that componentizing simulation models can have many advantages. the results also show that it is not easy to create models in a componentized way, and that current methods for simulation model building should be adapted.
the notion of temporal uncertainty, expressed as the possibility for an event to occur in an interval of simulation time, rather than at a specific instant, has been recently proposed and exploited in order to enhance...
详细信息
ISBN:
(纸本)0769521118
the notion of temporal uncertainty, expressed as the possibility for an event to occur in an interval of simulation time, rather than at a specific instant, has been recently proposed and exploited in order to enhance the performance of parallel/distributedsimulation systems. In this paper we propose the concept of "spatial uncertainty" expressed as the possibility for a simulation event to occur in one of a set of points within the simulated system space. How to handle/exploit space uncertain events in an optimistic simulation system is discussed. Also, experimental results for optimistic simulations of a Personal Communication System (PCS) modeled with space uncertain events are reported these results show the ability of spatial uncertainty to increase the performance of the parallelsimulation system by providing a more flexible approach to synchronization.
this paper advocates the use of a formal framework for analyzing simulation performance. simulation performance is characterized based on the three simulation development process boundaries: physical system, simulatio...
详细信息
ISBN:
(纸本)0769521118
this paper advocates the use of a formal framework for analyzing simulation performance. simulation performance is characterized based on the three simulation development process boundaries: physical system, simulation model, and simulator implementation. Firstly, we formalize simulation event ordering using partially ordered set theory. A simulator implements a simulation event ordering, and incurs implementation overheads when enforcing event ordering at runtime. Secondly, we apply our formalism to extract and formalize the simulation event orderings of both sequential and parallelsimulations. thirdly, we propose the relation stricter and a measure called strictness for comparing and quantifying the degree of event dependency of simulation event orderings respectively.
暂无评论