Time Warp is known for its ability to maximize the exploitation of the parallelism inherent in a simulation. However, this potential has been undermined by the cost of processing causality violations. Minimizing this ...
详细信息
Time Warp is known for its ability to maximize the exploitation of the parallelism inherent in a simulation. However, this potential has been undermined by the cost of processing causality violations. Minimizing this cost has been one of the most challenging issues facing Time Warp. In this paper, we present dependence list cancellation, a direct cancellation technique for Time Warp which is intended for use in a distributed memory environment such as a network of workstations. This approach provides for the swift cancellation of erroneous events, thereby preventing the propagation of their (erroneous) descendants. The dependence list also provides an event filtering function which detects erroneous future events, and also reduces the number of anti-messages used in the simulation. Our experimental work indicates that dependence list cancellation results in a dramatic reduction in the time required to process causality violations in Time Warp. We focus, in this paper, on reducing the processing time required for this correction. In doing so, we make use of the inherent dependence relationship between the events in a discrete event simulation. By this we mean the parent-child relationship between events;the child event is brought into the world as a result of processing the parent event. We present algorithms for the swift cancellation of the children of erroneously processed events. These algorithms are oriented towards a distributed environment, e.g. a network of workstations. In the following, we describe the algorithms and the manner in which they serve to efficiently cancel events (sections 2 and 3) as well as experimental work intended to evaluate their efficiency (section 4). Our concluding remarks are contained in section 5.
The proceedings contains 50 papers from the Ninth International Symposium on Modeling, Analysis and simulation of computer and Telecommunication systems. The topics discussed include: high-volume web servers;real time...
详细信息
The proceedings contains 50 papers from the Ninth International Symposium on Modeling, Analysis and simulation of computer and Telecommunication systems. The topics discussed include: high-volume web servers;real time systems;parallel and distributedsimulation;capacity planning;routing;network simulation;network traffic;benchmarking;switching;flie systems;and network traffic.
In this paper we present a simulation environment for storage area networks called SIMLAB. SIMLAB is a part of the PRESTO project, which is a joint project of the Electrical Engineering Department and the Computer Sci...
详细信息
The High Level Architecture (HLA) is a standard developed by the US Department of Defense (DoD), and is meant to establish interoperability among different types of simulations at multiple locations for the simulation...
详细信息
The Selectively Reliable Multicast Protocol (SRMP) provides an approach to reliable multicast that is specialized to distributed virtual simulation. SRMP operates in three modes of reliability: best-effort transmissio...
详细信息
This paper explores the feasibility of using the United States Department of Defense's High Level Architecture (HLA) for federating an existing simulation with itself. Although the HLA was not originally designed ...
详细信息
The complexity and dynamics of the Internet is driving the demand for scalable and efficient network simulation. Yet, parallelizing network simulation at packet level does not work efficiently and therefore do not sca...
详细信息
In September 2000, the IEEE approved the three High Level Architecture (HLA) documents as standards, 1516, 1516.1, and 1516.2. The form, functionality, and content of these documents are significantly the same as thei...
Extensive research has been conducted on the performance of simulation systems. In this paper, a performance analysis of the conservative parallelsimulation protocol is presented. We analyzed several performance fact...
详细信息
ISBN:
(纸本)076951104X
Extensive research has been conducted on the performance of simulation systems. In this paper, a performance analysis of the conservative parallelsimulation protocol is presented. We analyzed several performance factors for the conservative simulation of a model with an arbitrary number of logical processes. The analysis probabilistically identifies the critical path in a conservative model, and also estimates the number of safe messages processed by an logical process during its busy time. This can be used to estimate the busy time of a logical process and hence the duration for which it is blocked. The analytical results are verified using simulation of a real world wireless network simulation model.
This paper discusses the problem of risk in optimistic simulation protocols, using as an example, simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augme...
详细信息
ISBN:
(纸本)076951104X
This paper discusses the problem of risk in optimistic simulation protocols, using as an example, simulation of a distributed mutual exclusion protocol with strong consistency properties. The simulation model is augmented to detect model inconsistency errors resulting from risky optimistic simulation. While the model runs sequentially without consistency errors, errors occur when the model is executed in parallel optimistically. Some of the errors entirely violate the fundamental mutual exclusion properties of the model itself. To address this problem, we extend the optimistic simulation library to eliminate these inconsistencies. We discuss the details of these extensions and the performance tradeoff for adding them.
暂无评论