PADS

Circuit simulation has proven to be one of the most important computer aided design (CAD) methods for the analysis and validation of integrated circuit designs. A popular approach to describing circuits for simulation purposes is to use a hardware ...

The simulation of wide area computer networks is one area where the benefits of parallel simulation have been clearly demonstrated. Here we present a description of a system that uses a parallel discrete event simulator to act as a high speed network ...

This paper visits issues that recur in consideration of simulation time-stamps, in the context of building very large simulation models from components developed by different groups, at different times. A key problem here is “safety”, loosely defined to ...

While the PADS community has traditionally focused on—and done a greater job with—the technical aspects of developing simulations that run fast and can be connected to other simulations, it has paid little or no attention to the overall strategies ...

Algorithms for simulating an ATM switch on a distributed memory multiprocessor are described. These include parallel generation of bursty arrival streams, along with the marking and deleting of lost cells due to buffer overflows. These algorithms ...

In a large-scale distributed simulation with thousands of dynamic objects, efficient communication of data among these objects is an important issue. The broadcasting mechanism specified by the Distributed Interactive Simulation (DIS) standards is not ...

Multi-agent systems comprise multiple, deliberative agents embedded in and recreating patterns of interactions. Each agent's execution consumes considerable storage and calculation capacities. For testing multi-agent systems, distributed parallel ...

We have parallelized the Iowa Logic Simulator, a gate-level fine-grained discrete-event simulator, by employing an optimistic algorithm framework based on a global event queue implemented as a parallel heap. The original code and the basic data ...

In this paper we discuss new synchronization algorithms for Parallel and Distributed Discrete Event Simulations (PDES) which exploit the capabilities and behavior of the underlying communications network. Previous work in this areas has assumed the ...

Many synchronous algorithms have been proposed for parralel and discrete simulations. However, the actual performance of these algorithms have been far from ideal, especially when event granularity is small. Barring the case of low parallelism in the ...

Load balancing is a crucial factor in achieving good performance for parallel discrete event simulations. In this paper, we present a load balancing scheme that combines both static partitioning and dynamic load balancing. The static partitioning scheme ...

The concept of strong groups is introduced to describe the structure of simulation models. It is shown that logical processes within strong groups process at approximately the same rate and that different strong groups can progress at different rates. ...

In this paper we describe an approach to exploit temporal uncertainty in parallel and distributed simulation by utilizing time intervals rather than precise time stamps. Unlike previously published work that propose new message ordering semantics, our ...

It is well known that the critical path provides an absolute lower bound on the execution time of a conservative parallel discrete event simulation. It stands to reason that optimal execution time can only be achieved by immediately executing each event ...