The process interaction world view is widely used in the general simulation community for its expressive power and is supported by most modem simulation languages. In parallel discrete event simulation, however its us...
详细信息
ISBN:
(纸本)0818679654
The process interaction world view is widely used in the general simulation community for its expressive power and is supported by most modem simulation languages. In parallel discrete event simulation, however its use remains comparatively rare due to the perceived inefficiency (and difficulty) of parallel implementations. We present a new implementation strategy for parallel process-oriented simulation languages. This innovative, semantics-based approach directly addresses two common concerns of such languages. By concentrating on the intrinsic threads of control, we avoid the proliferation of simulation objects (and their associated costs) that might result from a naive translation. More fundamentally, the primary costs associated with process-oriented languages - those of context switching between stacks and, in an optimistic setting, of saving the state of these stacks - are entirely eliminated since our explicit use of continuations avoids the need for stacks in the first place. We similarly obtain cheap and natural thread pre-emption.
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 st...
详细信息
ISBN:
(纸本)1565550277
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 on application programs. The design of Maya and its simulation mechanism are discussed. Performance results on architectural simulation with different memory coherence protocols are presented. parallel discrete event simulation techniques are adopted for the executiondriven simulation of parallel architectures.
作者：
Rosato, VPucello, NENEA
HPCN Project Ente Nuove Tecnol Energia & Ambiente I-00100 Rome Italy
A code for Me simulation of X-ray diffraction pattern of a powder has been implemented on a massively parallel SIMD platform developed in the frame of the PQE2000 Project. The code allows the evaluation of the diffrac...
详细信息
ISBN:
(纸本)0769500595
A code for Me simulation of X-ray diffraction pattern of a powder has been implemented on a massively parallel SIMD platform developed in the frame of the PQE2000 Project. The code allows the evaluation of the diffraction pattern of atomic-scale models of both perfectly ordered and disordered structures. The code has been wed to investigate the structures resulting from the non-equilibrium alloying process of an immiscible metallic couple (Ag-Cu).
parallel discrete event simulation (PDES) of models with fine-grained computation remains a challenging problem. We explore the usage of POSE, our parallel Object-oriented simulation Environment, for application perfo...
详细信息
ISBN:
(纸本)0769523838
parallel discrete event simulation (PDES) of models with fine-grained computation remains a challenging problem. We explore the usage of POSE, our parallel Object-oriented simulation Environment, for application performance prediction on large parallel machines such as BlueGene. This study involves the simulation of communication at the packet level through a detailed network model. This presents an extremely fine-grained simulation: events correspond to the transmission and receipt of packets. Computation is minimal, communication dominates, and strong dependencies between events result in a low degree of parallelism. There is limited look-ahead capability since the outcome of many events is determined by the application whose performance the simulation is predicting. Thus conservative synchronization approaches are challenging for this type of problem. We present recent experiences and performance results for our network simulator and illustrate the utility of our simulator through prediction and validation studies for a molecular dynamics application.(1)
A number of library-based parallel and sequential network simulators have been designed. This paper describes a library, called GloMoSim (for Global Mobile system Simulator), for parallelsimulation of wireless networ...
详细信息
ISBN:
(纸本)0818684577
A number of library-based parallel and sequential network simulators have been designed. This paper describes a library, called GloMoSim (for Global Mobile system Simulator), for parallelsimulation of wireless networks. GloMoSim has been designed to be extensible and composable: the communication protocol stack for wireless networks is divided into a set of layers, each with its own API. Models of protocols at one layer interact with those at a lower (or higher) layer only via these APIs. The modular implementation enables consistent comparison of multiple protocols at a given layer. The parallel implementation of GloMoSim can be executed using a variety of conservative synchronization protocols, which include the null message and conditional event algorithms This paper describes the GloMoSim library, addresses a number of issues relevant to its parallelization, and presents a set of experimental results on the IBM 9076 SP, a distributed memory multi-computer. These experiments use models constructed from the library modules.
This paper presents an approach for speculative parallel execution of rendezvous-synchronized simulations. Rendezvous-synchronized simulation is based on the notions of processes and gates and on the rendezvous mechan...
详细信息
This paper presents an approach for speculative parallel execution of rendezvous-synchronized simulations. Rendezvous-synchronized simulation is based on the notions of processes and gates and on the rendezvous mechanism defined in the basic process algebra of Lotos - a standard formal specification language for temporal ordering[2]. Time is introduced via a mechanism similar to the delay behaviour annotation provided by the Topo toolset[4-6]. The algorithm allows speculative gate activations. This increases the available parallelism while ensuring correct execution of the computation. The model is used to describe closed stochastic queueing network simulations. Analysis of their execution results suggests that the model makes available a promising degree of parallelism.
Performance of Time Warp simulation systems are often measured on exclusively available parallel computing resources. In distributed systems exclusive use is normally not feasible. Instead, due to the multi-tasking op...
详细信息
Performance of Time Warp simulation systems are often measured on exclusively available parallel computing resources. In distributed systems exclusive use is normally not feasible. Instead, due to the multi-tasking operating systems, many users share the workstations and their availability for parallelsimulation purposes varies extensively. Time Warp has been found to be very sensitive to variations in available processing power. This paper presents two methods for a Time Warp VLSI simulation system to reduce the negative effect of a non-ideal environment on the execution of parallelsimulations. A dynamic load balancing algorithm which adapts to the change of available processing power is presented. This mechanism, together with a multi-cluster partitioning technique significantly improves the performance of Time Warp based simulation systems on heterogeneous computing resources.
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in the theory of permutation groups and can...
详细信息
ISBN:
(纸本)0769521118
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in the theory of permutation groups and can be calculated in polynomial time with the nauty algorithm [15]. We designed an algorithm to extract useful symmetries from the automorphism group, which can be used to create partitions derived from the graph's structure. Our approach is focused on composite graphs, for which identical subgraphs reoccur in the graph. If these identical subgraphs can be mapped onto each other by symmetries, the subgraphs are replaced by equivalent multivertices, resulting in a 'natural' aggregation of vertices. This approach is applied to parallelsimulation of a detailed IP-switch with a conservative synchronous algorithm. The experimental results show that even for good partitions, global and temporal load imbalances are inevitable.
暂无评论