We present two GVT computation algorithms for PDES techniques with event based activities, relying on a space-time memory abstraction. Algorithm 2 involves a modification in the activity control, and is based on an ep...
详细信息
We present two GVT computation algorithms for PDES techniques with event based activities, relying on a space-time memory abstraction. Algorithm 2 involves a modification in the activity control, and is based on an epoch coloring scheme. The effect of the modification is assessed through an experimental study on a simulator implemented in the Linda coordination language. Experiments are performed on a cluster of workstations, and show that the modified activity control discipline is able to enhance performance.
Ordering of simultaneous events in DES is an important issue as it has an impact on modelling expressiveness, model correctness as well as causal dependencies. In sequential DES this is a problem which has attracted m...
详细信息
Ordering of simultaneous events in DES is an important issue as it has an impact on modelling expressiveness, model correctness as well as causal dependencies. In sequential DES this is a problem which has attracted much attention over the years and most systems provide the user with tools to deal with such issues. This has also attracted some attention within the PDES community and we present an overview of these efforts. We have, however not yet found a scheme which provides us with the desired functionality. Thus, we present and evaluate some simple schemes to achieve a well defined ordering of events and means to identify both causally dependent and independent events with identical timestamps in the context of optimistic simulations. These schemes should be applicable also to conservative PDES.
This paper presents a checkpointing scheme for optimistic simulation which is a mixed approach between periodic and probabilistic checkpointing. The latter based on statistical data collected during the simulation, ai...
详细信息
This paper presents a checkpointing scheme for optimistic simulation which is a mixed approach between periodic and probabilistic checkpointing. The latter based on statistical data collected during the simulation, aims at recording as checkpoints states of a logical process that have high probability to be restored due to rollback (this is done in order to make those states immediately available). The periodic part prevents performance degradation due to state reconstruction (coasting forward) cost whenever the collected statistics do not allow to identify states highly likely to be restored. Hence, this scheme can be seen as a highly general solution to tackle the checkpoint problem in optimistic simulation. A performance comparison with previous solutions is carried out through a simulation study of a store-and-forward communication network in a two-dimensional torus topology.
The High Level Architecture (HLA) provides the specification of a software architecture for distributedsimulation. The baseline definition of the HLA includes the HLA Rules, The HLA Interface Specification, and the H...
详细信息
The High Level Architecture (HLA) provides the specification of a software architecture for distributedsimulation. The baseline definition of the HLA includes the HLA Rules, The HLA Interface Specification, and the HLA Object Model Template. The HLA Rules are a set of 10 basic rules that define the responsibilities and relationships among the components of an HLA federation. The HLA Interface Specification provides a specification of the functional interfaces between HLA federates and the HLA Runtime Infrastructure. The HLA OMT provides a common presentation format for HLA simulation and Federation Object Models. The HLA was developed over the past three years. It is in the process of being applied with simulations developed for analysis, training and test and evaluation and incorporated into industry standards for distributedsimulation by both the Object Management Group and the IEEE. This paper provides a discussion of key areas where there are technology challenges in the future implementation and application of the HLA.
Traditionally, parallel discrete-event simulators based on the Time Warp synchronization protocol have been implemented using either the shared memory programming model or the distributed memory, message passing progr...
详细信息
Traditionally, parallel discrete-event simulators based on the Time Warp synchronization protocol have been implemented using either the shared memory programming model or the distributed memory, message passing programming model. This was because the preferred hardware platform was either a shared memory multiprocessor workstation or a network of uniprocessor workstations. However, with the advent of clumps (cluster of shared memory multiprocessors), a change in this dichotomous view becomes necessary. We explore the design and implementation issues involved in exploiting this new platform for Time Warp simulations. Specifically, we present two generic strategies for implementing Time Warp simulators on clumps. In addition, we present our experiences in implementing these strategies on an extant distributed memory, message passing Time Warp simulator (WARPED). Preliminary performance results comparing the modified clump-specific simulation kernel to the unmodified distributed memory, message passing simulation kernel are also presented.
parallel database systems are the key to high performance database processing. In this paper, we propose parallel join algorithms in shared disk parallel database systems, where all coupled nodes are connected via a h...
详细信息
The bubble algorithm evaluated in this paper assures message deadlock freedom in k-ary n-cube network without wing virtual channels. This algorithm is based both on a dimension order routing (DOR) and on a restricted ...
详细信息
ISBN:
(纸本)0769500595
The bubble algorithm evaluated in this paper assures message deadlock freedom in k-ary n-cube network without wing virtual channels. This algorithm is based both on a dimension order routing (DOR) and on a restricted injection policy extended to the dimension changes. An exhaustive comparison between the bubble mechanism and the classical deterministic virtual channels solution is presented here. For that purpose, the message router of both proposals has been designed by using VHDL descriptions and the Synopsys VLSI CAD tool. Additionally :formal models of the routers, based on colored Petri nets, have been carried out together with simulation techniques in order to assure the validation of the results and shorten the design cycle. The performance evaluation of n-dimension tori highlights the benefits of the bubble algorithm as both the temporal delay and the necessary silicon area of the message router ape reduced.
There are at least three major obstacles thwarting widespread adoption of parallel discrete-event simulation: lack of need; lack of tools; and lack of predictability in behavior and performance. The plain truth is tha...
详细信息
There are at least three major obstacles thwarting widespread adoption of parallel discrete-event simulation: lack of need; lack of tools; and lack of predictability in behavior and performance. The plain truth is that most simulation studies can be adequately done on ordinary serial computers. parallelsimulation tools are products of research efforts, and simply do not stand up to the demands of modern software engineering. The results of 20 years of research in parallelsimulation reveal it to be a highly complex endeavour, with performance results very much dependent on implementation details and model characteristics. The Scalable simulation Framework (SSF) is an effort to address some these concerns. It addresses lack of need in two ways; it provides a modeling API that is attractive both for serial and parallelsimulation, with parallel execution requiring no change to the model, and it targets large-scale telecommunication system modeling, an application area that requires the computational capabilities of parallelism. We address the concern over unpredictable behavior. We show how we measured the internal overheads of the Dartmouth implementation of the SSF API (DaSSF), and how those measurements can be used to predict the performance of a given model, using given features of the simulator, without having to run, or even build, the model.
There has been a growing interest in the HLA proposal as a common framework for real-time, distributed and interactive simulations. Although most of HLA compliant federates are for the moment developed with general pu...
详细信息
The GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are deleted to a single discipline, can be ...
详细信息
ISBN:
(纸本)0769500595
The GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are deleted to a single discipline, can be interconnected to a complex simulation system via the GRISSLi coupling interface without recoding the participating programs. We introduce a data model to establish the links between the (dynamic) grids and the attached coupling values in a single application program and to establish the mappings between grids and coupling values among different application programs. The user-specified consistency model is realized ruing asynchronous communication based on the MPI message passing standard Efficient communication is achieved by pre-computing an optimized communication schedule and overlapping communication with computation. Flexible coupling algorithms with adaptive grids and branches are supported in GRISSLi. We have developed a prototype implementation, which provides language bindings in ANSI C and Fortran, and runs currently on IBM RS/6000 SP Gray T3E, SGI Origin/Octane and HP-V Class. We verify the functionality and evaluate the performance of our library rising an industry relevant pilot application, the steel strip production process.
暂无评论