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 buffe...
ISBN:
(纸本)9780769506678
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 increase the amount of computation carried out independently by each processor, and reduce the communication between the processors. When the number of cells lost is relatively small, the run time of the simulation is approximately O(N/P), where N is the total number of cells simulated and P is the number of processors. The cells are processed in intervals of fixed length; that length affects the structure and the performance of the algorithms.
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 group...
详细信息
ISBN:
(纸本)9780769506678
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. An algorithm based on the rates of the strong groups is presented to balance the load among the physical processors and for flow control.
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-ag...
ISBN:
(纸本)9780769506678
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, distributedparallelsimulation techniques are required that take the dynamic pattern of composition and interaction of multi-agent systems into account. Analyzing the behavior of agents in virtual, dynamic environments necessitates relating the simulation time to the actual execution time of agents. Since the execution time of deliberative components can hardly be foretold, conservative techniques based on lookahead are not applicable. On the other hand, optimistic techniques become very expensive if mobile agents and the creation and deletion of model components are affected by a rollback. The developed simulation layer of JAMES (a Java Based Agent Modeling Environment for simulation) implements a moderately optimistic strategy which splits simulation and external deliberation into different threads and allows simulation and deliberation to proceed concurrently by utilizing simulation events as synchronization points.
The simulation of wide area computer networks is one area where the benefits of parallelsimulation have been clearly demonstrated. Here we present a description of a system that uses a parallel discrete event simulat...
详细信息
ISBN:
(纸本)9780769506678
The simulation of wide area computer networks is one area where the benefits of parallelsimulation 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 emulator. With this, real Internet Protocol (IP) traffic generated by application programs running on user workstations can interact with modelled traffic in the emulator, thus providing a controlled test environment for distributed *** network emulator uses the TasKit conservative parallel discrete event simulation (PDES) kernel. TasKit has been shown to be able to achieve improved parallel performance over existing conservative and optimistic PDES kernels, as well as improved sequential performance over an existing central-event-list based kernel. This paper explains the modifications that have been made to TasKit to enable real-time operation along with the emulator interface that allows the IP network simulation running in the TasKit kernel to interact with real IP clients. Initial emulator performance data is included.
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 att...
ISBN:
(纸本)9780769506678
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 required to produce a marketable, useful, and successful parallelsimulation. This lack of market focus has led to many fears of the demise of the PADS community, complaints of its lack of general acceptance by the broader simulation community, and predictions that it will become merely another venue for simulation *** fears, complaints, and predictions are unnecessary. There are several examples of successful parallelsimulations—in domains as far apart as aviation modeling and wargames. What can we learn from their successes? How can we translate their general acceptance into other parallelsimulation domains? Are there market opportunities that we are missing? In short, what is the parallelsimulation community lacking, and what does it need to do in order to be more successful?The purpose of this talk is to begin a discussion on the answers to these questions (as opposed to definitively answering them). We will draw on numerous examples of successful applications, and make some concrete suggestions for furthering the community.
In a large-scale distributedsimulation with thousands of dynamic objects, efficient communication of data among these objects is an important issue. The broadcasting mechanism specified by the distributed Interactive...
详细信息
ISBN:
(纸本)9780769506678
In a large-scale distributedsimulation 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 suitable for large scale distributed *** the High Level Architecture (HLA) paradigm, the Runtime Infrastructure (RTI) provides a set of services, such as data distribution management (DDM) among federates. The goal of the DDM module in RTI is to make the data communication more efficient by sending the data only to those federates that need the data, as opposed to the broadcasting mechanism employed by *** DDM schemes have appeared in the literature. In this paper, we discuss grid-based DDM and develop a DDM model that uses grids for matching the publishing/subscription regions, and for data filtering. We show that appropriate choice of the grid-cell size is crucial in obtaining good performance. We develop an analytical model and derive a formula for identifying the optimal cell size in grid-based DDM.
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...
ISBN:
(纸本)9780769506678
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 description language such as VHDL. Similar efforts have also been carried out in the analog domain that has led to tools such as SPICE. However, with the growing trend of hardware designs that contain both analog and digital components, design environments that seamlessly integrate analog and digital circuitry are needed. simulation of such circuit is however, exacerbated by the higher resource (CPU and memory) demands that arise when analog and digital models are integrated in a mixed-mode (analog and digital) simulation. One solution to this problem is to use PDES algorithms on a distributed platform. However, a synchronization interface between the analog and digital simulation environment is required to achieve integrated mixed-mode simulation. In this paper, we present the issues involved in the construction of synchronization protocols which support mixed-mode simulation in a distributedsimulation environment. The proposed synchronization protocols provide an interface between an optimistic (Time Warp based) discrete-event simulation kernel and any continuous time simulation kernel. Empirical and formal analyses were conducted to ensure correctness and completeness of the protocols and the results of these analyses are also presented.
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 origi...
详细信息
ISBN:
(纸本)9780769506678
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 structures of the serial simulator remained unchanged. Wrapper data structures for the logical processes (gates) and the events are created to allow rollbacks, all the earliest events at each logical processes are stored into the parallel heap, and multiple earliest events are simulated repeatedly by invoking the simulate function of the serial simulator. The parallel heap allowed extraction of hundreds to thousands of earliest events in each queue access. On a bus-based shared-memory multiprocessor, simulation of synthetic circuits with 250,000 gates yielding speedups of 3.3 employing five processors compared to the serial execution time of the Iowa Logic Simulator, and limited the number of rollbacks to within 2,000. The basic steps of parallelization are well-defined and general enough to be employable on other discrete-event simulators.
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 balan...
ISBN:
(纸本)9780769506678
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 maps simulation objects to logical processes before simulation starts while the dynamic load balancing scheme attempt to balance the load during runtime. The static scheme involves two steps. First, the simulation objects that contribute to small lookahead are merged together by using a merging algorithm. Then a partitioning algorithm is applied. The merging is needed to ensure a consistent performance for our dynamic scheme. Our dynamic scheme is tailor-made for an asynchronous simulation protocol that does not rely on null messages. The performance study on a supply-chain simulation shows that the partitioning algorithm and dynamic load balancing are important in achieving good performance.
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to...
详细信息
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to improve the quality of solutions to the problem by applying parallelism.
暂无评论