In this paper we describe a distributed-memory parallel implementation of the Open network Emulator (ONE), a network simulator that combines the controllability of simulation with the direct code execution advantages ...
详细信息
ISBN:
(纸本)9781450324649
In this paper we describe a distributed-memory parallel implementation of the Open network Emulator (ONE), a network simulator that combines the controllability of simulation with the direct code execution advantages of emulation and experimental testbeds. ONE uses a scaled real-time model called Relativistic Time (RT). We describe a RT-based reactive global warp detection algorithm to exploit lookahead. The Distributed ONE system provides a platform for networksimulation that combines model fidelity (existing network applications can be compiled and instantiated within ONE without modification), temporal fidelity, and good scalability. We present strong and weak scaling performance results for the Distributed ONE system on up to sixteen nodes of a distributed-memory parallel cluster, on simulations involving up to 16,000 virtual hosts.
Traditional topology partition of parallel network simulation usually uses topology graph partition, that is to induce actual network simulate task to a weighted graph, Then use certain tools to complete the partition...
详细信息
Traditional topology partition of parallel network simulation usually uses topology graph partition, that is to induce actual network simulate task to a weighted graph, Then use certain tools to complete the partition of simulation tasks, such as METIS, Chaco;These traditional tools usually perform very good when the simulation environment is of the same structure. However, in the complex physical computing environment, such as a large number of computing nodes whose calculation ability is different, a wide gap on the communication capabilities and so on, the traditional topology partition tools is difficult to achieve efficiency optimal, resulting in computing power a tremendous waste. Therefore, we introduce a Cluster Instructed Partitioning Algorithm (CIPA), suitable for partitioning simulation tasks for heterogeneous platform. In complex network environment, this method organizes the computing nodes by clustering, and distributes the simulated topology to the computing nodes properly combined with the improved topology graph partition. It can get a balanced partitioning result, and greatly improve the efficiency of the entire system.
Efficiently scheduling and synchronizing parallel event execution constitutes the fundamental challenge in parallel discrete event simulation. Existing synchronization algorithms typically do not analyze event interac...
详细信息
ISBN:
(纸本)9781450315104
Efficiently scheduling and synchronizing parallel event execution constitutes the fundamental challenge in parallel discrete event simulation. Existing synchronization algorithms typically do not analyze event interactions within the simulation model -- mainly to minimize runtime overhead and complexity. However, we argue that disregarding event interactions results in a lack of insight into the behavior of the simulation model, thereby severely limiting synchronization efficiency and thus parallel performance. In this paper, we present a probabilistic synchronization scheme that obtains extensive knowledge of the simulation behavior at runtime to guide event execution. Specifically, we design three heuristics that dynamically derive event dependencies from tracing event interactions and decide whether or not to speculatively execute events. Our evaluation shows that the proposed probabilistic synchronization scheme considerably outperforms traditional conservative and optimistic schemes.
Developing an efficient parallelsimulation framework for multiprocessor systems is hard. A primary concern is the considerable amount of parallelization overhead imposed on the event handling routines of the simulato...
详细信息
ISBN:
(纸本)9781936968008
Developing an efficient parallelsimulation framework for multiprocessor systems is hard. A primary concern is the considerable amount of parallelization overhead imposed on the event handling routines of the simulator. Besides complex event scheduling algorithms, the main sources of overhead are thread synchronization and locking of shared data. Thus, compared to sequential simulation, the overhead of parallelization may easily outweigh its performance *** introduce two efficient event handling schemes based on our parallel-simulation extension Horizon for OMNeT++. First, we present a push-based event handling scheme to minimize the overhead of thread synchronization and locking. Second, we complement this scheme with a novel event scheduling algorithm that significantly reduces the overhead of parallel event scheduling. Lastly, we prove the correctness of the scheduling algorithm. Our evaluation reveals a total reduction of the event handling overhead of up to 16x.
Performance analysis is a key issue in parallel network simulation. This paper proposes a new mechanism of parallel network simulation performance prediction. Analyzing the key factors of impacting parallelsimulation...
详细信息
ISBN:
(纸本)9780769537283
Performance analysis is a key issue in parallel network simulation. This paper proposes a new mechanism of parallel network simulation performance prediction. Analyzing the key factors of impacting parallelsimulation performance, six parameters which may determine the time-cost of networksimulation is presented. Then we adopt the Back Propagation (BP) network to approximate to the non-linear relation between time-cost and these parameters. So we can carry out a very good prediction to the new networksimulation missions with BP nets. This mechanism also does not require configuring all the workstation with same kind of hardware/software environment.
We present a case study in which we apply parallelsimulation methods and interoperability techniques to networksimulations for simulation-based on-line control of military communication networks. The on-line simulat...
详细信息
ISBN:
(纸本)9780769516080
We present a case study in which we apply parallelsimulation methods and interoperability techniques to networksimulations for simulation-based on-line control of military communication networks. The on-line simulations model actual military networks, including wired shipboard sub-networks connected via satellite links, and wireless mobile devices. The modeled scenario depicts the communication requirements of an amphibious landing where a complex network connects troops ashore and naval vessels. The simulations use a heterogeneous set of tools, including ns2 models for shipboard wired networks, and GloMoSim models for the wireless devices. In this paper, we document the challenges we encountered in applying parallel and interoperable simulation methods, and describe our solutions. We describe our experiences in addressing the interoperability problems that naturally arose due to the heterogeneity of scenario models. We also present a preliminary study on the scalability of real-time performance of parallel network simulations, which is crucial for on-line simulations. Salient system characteristics of the subject military network scenarios are described for the benefit of exposure to the modeling and simulation research community. Our exercise not only highlights the relevance of parallel and distributed simulation techniques to an important real-life problem, but also demonstrates the feasibility of applying those techniques in a practical setting.
暂无评论