We show that the latest version of massively parallelprocessing associative string processing architecture (System-V) is applicable for fast Monte Carlo simulation if an effective on-processor random number generator ...
详细信息
ISBN:
(纸本)0769500595
We show that the latest version of massively parallelprocessing associative string processing architecture (System-V) is applicable for fast Monte Carlo simulation if an effective on-processor random number generator is implemented. Our lagged Fibonacci generator can produce 10(8) random numbers on a processor string of 12K PE-s. The time dependent Monte Carlo algorithm of the one-dimensional non-equilibrium kinetic Ising model perfoms 80 faster than the corresponding serial algorithm on a 300 MHz UltraSparc.
A methodology and its associated algorithms are presented for mapping a novel, field-based vehicular mobility model onto graphical processing unit computational platform for simulating mobility in large-scale road net...
详细信息
ISBN:
(纸本)9780769537139
A methodology and its associated algorithms are presented for mapping a novel, field-based vehicular mobility model onto graphical processing unit computational platform for simulating mobility in large-scale road networks. Of particular focus is the achievement of real-time execution, on desktop platforms, of vehicular mobility on road networks comprised of millions of nodes and links, and multi-million counts of simultaneously active vehicles. The methodology is realized in a system called GARFIELD, whose implementation details and performance study are described The runtime characteristics of a prototype implementation are presented that show real-time performance in simulations of networks at the scale of a few states of the US road networks.
The carrier-null message approach to conservative distributed discrete-event simulation can significantly reduce the number of synchronization messages required to avoid deadlock. In thts paper we show that the origin...
详细信息
ISBN:
(纸本)1565550277
The carrier-null message approach to conservative distributed discrete-event simulation can significantly reduce the number of synchronization messages required to avoid deadlock. In thts paper we show that the original approach does not apply to simulations with arbitrary communication graphs and we propose a modified carrier-null approach whtch does. We present and discuss some preliminary results obtained using our approach to simulate digital logic circuits.
Conservative parallel discrete event simulation takes a connection-oriented approach to inter-process communication. Conservative processes modeling physical entities are connected via channels that represent physical...
详细信息
ISBN:
(纸本)0769521118
Conservative parallel discrete event simulation takes a connection-oriented approach to inter-process communication. Conservative processes modeling physical entities are connected via channels that represent physical links in the target system. By contrast, optimistic strategy and its implementation in Time Warp machine, take a connectionless approach where a process can communicate freely with any other process without prior connection. This paper presents the case for a connection-oriented optimistic approach and provides a data structure for the event set of Time Warp processes that significantly reduces the cost of event scheduling and cancellation under connection-oriented operation. Detailed description of the proposed implementation is given and performance of the structure in forward event scheduling and backward event cancellation is tested and the results are discussed.
The proceedings contain 24 papers. The topics discussed include: realising parallel and distributedsimulation in industry: a roadmap;distribution of random streams in stochastic models in the age of multi-core and ma...
ISBN:
(纸本)9781457713668
The proceedings contain 24 papers. The topics discussed include: realising parallel and distributedsimulation in industry: a roadmap;distribution of random streams in stochastic models in the age of multi-core and manycore processors;parallel discrete event N-body dynamics;modeling billion-node torus networks using massively parallel discrete-event simulation;empirical study on entity interaction graph of large-scale parallelsimulations;collaborative interest management for peer-to-peer networked virtual environment;dead reckoning-based update scheduling against message loss for improving consistency in DVEs;trading computation time for synchronization time in spatial distributedsimulation;framework for simulation of hybrid systems: interoperation of discrete event and continuous simulators using HLA/RTI;an analysis of the cost of validating semantic composability;and fairness verification of BOM-based composed models using petri nets.
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.
In this paper we consider the distributedsimulation of queueing networks of FCFS servers with infinite buffers, and irreducible Markovian routing. We first show that for either the conservative or optimistic synchron...
详细信息
In this paper we consider the distributedsimulation of queueing networks of FCFS servers with infinite buffers, and irreducible Markovian routing. We first show that for either the conservative or optimistic synchronization protocols the simulation of such networks can prematurely block owing to event buffer exhaustion. Buffer exhaustion can occur in the simulator whether or not the simulator is stable, and, unlike simulators of feedforward networks, cannot be prevented by interprocessor flow control alone. We propose a simple technique (which we call compactfication), which, when used in conjunction with interprocessor flow control, prevents buffer exhaustion. This leads to a general algorithm, for both conservative and optimistic synchronization, that allows one to simulate the queueing network within the finite amount of memory available at each processor. For each algorithm presented we also provide the proof that it cannot get deadlocked owing to buffer exhaustion.
Distributing computation among multiple processors is one approach to reducing simulation time for large VLSI circuit designs. However, parallelsimulation introduces the problem of how to partition the logic gates an...
详细信息
Distributing computation among multiple processors is one approach to reducing simulation time for large VLSI circuit designs. However, parallelsimulation introduces the problem of how to partition the logic gates and system behaviors of the circuit among the available processors in order to obtain maximum speedup. A complicating factor that is often ignored is the effect of the time-synchronization protocol (conservative [1] or optimistic [2]). Inherent in the partitioning problem is the question of how to effectively measure the relative quality of a partition. This paper describes an objective cost function for measuring the relative quality of a task partition that includes a synchronization factor for a conservative NULL-message protocol. A graph-based partitioning tool based on this cost function is used to perform the static task allocation for parallelsimulation of a structural VHDL circuit. Results for two 1000 - 4000 gate circuits demonstrate that the additional consideration of the synchronization protocol in the cost function generates partitions that exhibit improved speedup.
This paper introduces a Coloured Petri Nets formalism -TCPN- which is suitable for modelling and simulation of complex systems. Novel in TCPN is (i) a timing model which accommodates both unordered and ordered (queue)...
详细信息
ISBN:
(纸本)0769518532
This paper introduces a Coloured Petri Nets formalism -TCPN- which is suitable for modelling and simulation of complex systems. Novel in TCPN is (i) a timing model which accommodates both unordered and ordered (queue) places;(ii) the adoption of Java as the net inscription language. TCPN is supported by a graphical tool RAINBOW - which allows model design, testing and simulation. A large TCPN model can be split into regions (subnets) whose execution is assigned to different LP/processors of a networked simulator. distributedsimulation relies on TUTW an agent-based Time Warp algorithm capable of exploiting temporal uncertainty for improving simulation performance. The paper describes TCPN and its distributed execution kernel. The practical use of TCPN is demonstrated through an example and some experimental results.
The spatial scale, runtime speed and behavioral detail of epidemic outbreak simulations together require the use of large-scale parallel processing. In this paper, an optimistic parallel discrete event execution of a ...
详细信息
暂无评论