PADS

Generalized proximity detection for moving objects in a logically correct parallel discrete-event simulation is an interesting and fundamentally challenging problem. Determining who can see whom in a manner that is fully scalable in terms of CPU usage, ...

A great deal of research in the area of distributed discrete event simulation has focussed on evaluating the performance of variants of conservative and optimistic methods on different types of applications. Application characteristics like lookahead, ...

A new adaptive protocol for distributed discrete event simulation is proposed. This protocol spans the continuum of protocols from conservative to optimistic allowing each process in a distributed simulation to adapt to the specific simulation problem ...

This paper describes issues concerning the design of an optimistic parallel discrete event simulation system that executes in environments that impose real-time constraints on the simulator's execution. Two key problems must be addressed by such a ...

This paper describes a tool, LAPSE (Large Application Parallel Simulation Environment), that allows one to use a small number of parallel processors to simulate the behavior of a message-passing code running on a large number of processors, for the ...

The event horizon is a very important concept that is useful for both parallel and sequential discrete-event simulations. By exploiting the event horizon, parallel simulations can process events in a manner that is risk-free (i.e., no antimessages) in ...

The carrier-null message approach to conservative-distributed discrete-event simulation can significantly reduce the number of synchronization messages required to avoid deadlock. In this paper we show that the original approach does not apply to ...

Robustness of the simulation mechanism is a requirement for acceptability of distributed simulation environments. We consider complex and erratic distributed conservative simulations, using colliding pucks as a guiding example. A new mechanism is ...

This paper is concerned with the behaviour of message queues in distributed discrete event simulators. We view a logical process in a distributed simulation as comprising a message sequencer with associated message queues, followed by an event ...

Parallel independent replicated simulation (PIRS) is an effective approach to speed up the simulation processes. In a PIRS, a single simulation run is executed by multiple computers in parallel. The statistical properties for a PIRS may be affected by ...

Simulations running under Time Warp using lazy cancellation can beat the bound given by the critical path. We explain this phenomenon to be the result of a kind of intra-object parallelism. Specifically, we show that instances of beating the critical ...

Approaches to state saving and rollback for a shared memory, optimistically synchronized, simulation executive are presented. An analysis of copy state saving and incremental state saving is made and these two schemes are compared. Two benchmark ...

The time warp mechanism uses memory space to save event and state information for rollback processing. As the simulation advances in time, old state and event information can be discarded and the memory space reclaimed. This reclamation process is ...

In Time Warp optimistic discrete event simulation, there exists a need to occasionally save the states of the logical processes. The state saving often constitutes a substantial overhead. However it is not necessary to save each state of a logical ...

This paper describes results of an empirical study to evaluate the effect of communications delays on the performance of the Time Warp mechanism in order to assess the effectiveness of Time Warp in distributed computing environments. An implementation ...

In this paper we make an analogy between the time that storage must be maintained in an optimistic simulation and the blocking time in a conservative simulation. By exploring this analogy, we design two new Global Virtual Time (GVT) protocols for Time ...

Simulation of communication networks is often time consuming. Parallel simulation may be used to reduce the execution time of such a simulator. However, efficient modeling and simulation of such complex applications is not a trivial task. In this paper, ...

One of the significant difficulties in partitioning logic circuits for distributed simulation is the lack of a priori knowledge concerning the evaluation frequency of individual circuit elements. A number of researchers have resorted to pre-simulation ...

Performance of VHDL simulation is a critical issue in electronic circuit design and is hard to achieve due to the complexity of the language and the different abstraction levels.

This paper presents a system for performance evaluation of distributed-time ...

Maya is a simulation platform for evaluating the performance of parallel programs on parallel architectures. It allows the rapid prototyping of memory protocols with varying degrees of coherence and facilitates the study of the impact of these protocols ...

Accelerating discrete event simulation can be achieved by using parallel architectures. The use of dedicated hardware is a possible alternative in some special domains like logic simulation. However, few studies have focused on general cases.

This paper ...

In this paper, we consider the problem of partitioning a conservative parallel simulation for execution on a multi-computer. The synchronization protocol makes use of null messages [6]. We propose the use of a simulated annealing algorithm with an ...

This paper examines the cost/performance of simulating a hypothetical target parallel computer using a commercial host parallel computer. We address the question of whether parallel simulation is simply faster than sequential simulation, or if it is ...

In this paper we discuss the application of domain decomposition methods to circuit simulation. This coarse grain parallelization guarantees a minimum of communication and thus achieves good speedup results on a workstation cluster. Our results show ...

Fast, efficient parallel algorithms are presented for discrete event simulations of dynamic channel assignment schemes for wireless cellular communication networks. The driving events are called arrivals and departures, in continuous time, to cells ...