the proceedings contain 19 papers. the topics discussed include: conservative simulation using distributed-shared memory;the lookahead in a user-transparent conservative parallel simulator;addressing blocking and scal...
ISBN:
(纸本)0769516084
the proceedings contain 19 papers. the topics discussed include: conservative simulation using distributed-shared memory;the lookahead in a user-transparent conservative parallel simulator;addressing blocking and scalability in critical channel traversing;early cancellation: an active NIC optimization for time-warp;critical causality in distributed virtual environments;a scalable architecture for supporting interactive games on the Internet;evaluation of a sort-based matching algorithm for DDM;lookahead revisited in wireless network simulations;genesis: a system for large-scale parallel network simulation;experiences applying parallel and interoperable network simulation techniques in on-line simulations of military networks;updateable simulation of communication networks;and stone axes and warhammers: a decade of distributedsimulation in aviation research.
the following topics are dealt with: conservative simulation using distributed shared memory; parallelsimulation; optimistic simulation; virtual environments and HLA; network simulation; distributedsimulation; and d...
the following topics are dealt with: conservative simulation using distributed shared memory; parallelsimulation; optimistic simulation; virtual environments and HLA; network simulation; distributedsimulation; and discrete event simulation.
the proceedings contain 30 papers. the special focus in this conference is on TAPEMS 2016 and BigTrust 2016. the topics include: An in-memory event tracing extension to the open trace format 2;network-aware optimizati...
ISBN:
(纸本)9783319499550
the proceedings contain 30 papers. the special focus in this conference is on TAPEMS 2016 and BigTrust 2016. the topics include: An in-memory event tracing extension to the open trace format 2;network-aware optimization of MPDATA on homogeneous multi-core clusters with heterogeneous network;formalizing data locality in task parallel applications;improving the energy efficiency of evolutionary multi-objective algorithms;a parallel model for heterogeneous cluster;comparative analysis of OpenACC compilers;traffic sign recognition based on parameter-free detector and multi-modal representation;reversible data hiding using non-local means prediction;secure data access in hadoop using elliptic curve cryptography;statistical analysis of CCM.M-K1 international comparison based on monte carlo method;redundancy elimination in the ExaStencils code generator;a dataflow IR for memory efficient RIPL compilation to FPGAs;exploring a distributed iterative reconstructor based on split bregman using PETSc;implementation of the beamformer algorithm for the NVIDIA jetson;efficiency of GPUs for relational database engine processing;geocon;a middleware for location-aware ubiquitous applications and cellular ANTomata as engines for highly parallel pattern processing.
One of the difficulties inherent to conservative parallel discrete event simulation (PDES) is the need for extraction and explicit specification of the lookahead. In this paper we propose a simulator design which allo...
ISBN:
(纸本)0769516084
One of the difficulties inherent to conservative parallel discrete event simulation (PDES) is the need for extraction and explicit specification of the lookahead. In this paper we propose a simulator design which allows users to build simulation models with lookahead transparently, this is based on the cooperation between PDES experts and the users, and on the reusability, of model components. We introduce the principal design of the simulator and give the results related to its lookahead.
Ten years ago, MITRE/CAASD built a realtime, Human-In-the-Loop (HITL) research laboratory. the focus of this lab is integration and human factors research for the air traffic control and aviation communities. the last...
ISBN:
(纸本)0769516084
Ten years ago, MITRE/CAASD built a realtime, Human-In-the-Loop (HITL) research laboratory. the focus of this lab is integration and human factors research for the air traffic control and aviation communities. the last ten years have been illuminating in terms of the evolution of laboratory capabilities, infrastructure, and corporate culture. this paper will describe the laboratory environment, its history and vision, and will also provide some examples of how distributedsimulation technology has been applied, and continues to evolve, in a real-world HITL simulation environment serving a broad range of research needs.
Lookback is defined as the ability of a logical process to change its past locally (without involving other logical processes). Logical processes with lookback are able to process out-of-timestamp order events, enabli...
ISBN:
(纸本)0769516084
Lookback is defined as the ability of a logical process to change its past locally (without involving other logical processes). Logical processes with lookback are able to process out-of-timestamp order events, enabling new synchronization protocols for the parallel discrete event simulation. Two of such protocols, LB-GVT (LookBack-Global Virtual Time) and LB-EIT (LookBack-Earliest Input Time), are presented and their performance on the Closed Queuing Network (CQN) simulation is discussed. We also discuss in detail the relation between lookahead and lookback. Finally, we demonstrate that lookback allows conservative simulations to circumvent the speedup limit imposed by the critical path.
this paper focuses on conservative simulation using distributed-shared memory for inter-processor communication. JavaSpaces, a special service of Java Jini, provides a shared persistent memory for simulation message c...
ISBN:
(纸本)0769516084
this paper focuses on conservative simulation using distributed-shared memory for inter-processor communication. JavaSpaces, a special service of Java Jini, provides a shared persistent memory for simulation message communication among processors. Two benchmark programs written using our SPaDES/Java parallelsimulation library are used. the first program is a linear pipeline system representing a loosely-coupled open system. the PHOLD program represents a strongly-connected closed system. Experiments are carried out using a cluster of Pentium II PCs. We used a combination of Wood Turner carrier null, flushing and demand-driven algorithms for null message synchronization. To optimize message communication, we replace SPaDES/Java inter-processor communication implemented using Java's Remote Method Invocation (RMI) with one JavaSpace. For PHOLD (16x16, 16) running on eight processors, this change reduces simulation runtime by more than half, null message overhead reduces by a further 15%, and event rate more than doubled. Based on our memory analysis methodology, the memory, cost of null message synchronization for PHOLD is less than 9% of the total memory needed by, the simulation.
this paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when use...
详细信息
ISBN:
(纸本)0769516084
this paper presents two new versions of the Critical Channel Traversing (CCT) algorithm. CCT is a conservative parallel discrete event simulation algorithm that has been shown to achieve very high performance when used in a wide area computer network simulator the first of the new algorithms called simple sender side CCT is similar to the original, but busy waiting is eliminated. Results presented show that simple sender side CCT avoids performance problems that can be caused by busy waiting. the second new algorithm called receive side CCT employs a different strategy for updating channel clocks and determining which objects should be scheduled on critical channels. Performance results show that this version provides better scaling with respect to the connectivity of the model, at the expense of some added complexity.
Faster-than-real-time simulation (FRTS) can be used for the performance evaluation of systems behavior in real time, providing significant capabilities for studying systems with a time-varying behavior. FRTS enables m...
ISBN:
(纸本)0769516084
Faster-than-real-time simulation (FRTS) can be used for the performance evaluation of systems behavior in real time, providing significant capabilities for studying systems with a time-varying behavior. FRTS enables model validation through comparing simulation results withthe corresponding system observations. However, experimentation proves to be rather demanding, as both delivering output results and ensuring their reliability must be accomplished within a predetermined time frame. Output analysis of system observations and model results and relevant timing issues are discussed. A method is introduced that determines whether it is possible to execute the "optimal" faster-than-real-time experiment, in which case multiple replications are scheduled for execution, or a compromise has to be made between the ability to predict for the long future and the degree of reliability achieved for predictions. FRTS experimental results are also presented to support the effectiveness of the proposed method.
parallelsimulations using optimistic synchronization strategies such as Time Warp, operate with no regard to global synchronization since this results in greater parallelism and lower synchronization cost. However, l...
ISBN:
(纸本)0769516084
parallelsimulations using optimistic synchronization strategies such as Time Warp, operate with no regard to global synchronization since this results in greater parallelism and lower synchronization cost. However, like virtual memory, the parallel simulators may end up thrashing instead of performing useful work. the complication in using a Time Warp simulator is then to configure it suitably for good performance and avoid thrashing. Unfortunately, the optimal configuration is not generally static among different applications or even throughout an entire run of a single application. thus, online feedback control systems are deployed to govern the adjustment of input parameters in our Time Warp simulation kernel. the design and implementation of effective feedback control systems can be difficult;the extra processing is pure overhead that must be absorbed by an), performance gains delivered. the problem is further complicated when attempting to build a simulation kernel that is designed efficiently to operate with many different applications. In this paper, we introduce a control-centric architecture that is used to monitor and manage different parts of a Time Warp simulator Specifically, we extend concepts from control theory such as adaptive control and stability, to better understand and design hierarchically-distributed run-time control systems for Time Marp based parallelsimulation.
暂无评论