This paper presents the SEEDS simulation environment for the evaluation of distributed traffic control systems. Starting with an overview of the general simulator architecture, the software modules and the derived har...
详细信息
This paper presents the SEEDS simulation environment for the evaluation of distributed traffic control systems. Starting with an overview of the general simulator architecture, the software modules and the derived hardware architecture of the simulation environment are described with respect to performance requirements. The communication architecture of the SEEDS simulator is based on the CORBA standard and the DIS simulation protocol. With the SEEDS prototype simulating airport ground-traffic, performance measurements evaluating critical design and implementation decisions are described. The main aspects of the performance analysis are the attained application performance using CORBA and DIS as communication middleware, and the scalability of the overall approach. The evaluation shows the appropriateness of the design of the simulation environment and the derived hard- and software architecture, which is flexible and open to further extensions. Moreover the combination of CORBA and DIS provides a suited platform for distributed interactive simulation purposes because of the adequate performance, high scalability, and the high-level programming model which allows to rapidly develop and maintain complex distributed applications with high-performance requirements.
The GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are devoted to a single discipline, can be ...
详细信息
The GRISSLi coupling interface is a runtime library designed for the coupled computation of grid-based multidisciplinary applications. Established simulation programs, which are devoted 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 using 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 using an industry relevant pilot application, the steel strip production process.
Interval temporal logic (ITL) is a real-time logic for specifying and verifying real-time systems. In this paper, ITL is used to specify a concurrent real-time system: an assembly line which is an abstract model of in...
详细信息
Interval temporal logic (ITL) is a real-time logic for specifying and verifying real-time systems. In this paper, ITL is used to specify a concurrent real-time system: an assembly line which is an abstract model of industrial robot control systems. We can specify the abstract properties of the system in ITL as well as the system design using the executable subset of ITL, Tempura. Compared with other approaches, the first advantage of this methodology is that the concurrent real-time systems can be naturally specified in a true concurrent model rather than an interleaving model. The second is that the specification of the system design is executable so that the simulation can be obtained in the same formal framework. Therefore, both the properties of the system and the consistency of the specification can be checked before verification.
The Extended Air Defense Testbed (EADTB), is a comprehensive, high- and mixed-level-of-detail, environment for modeling weapon system entities and interactions. Due to the complexity of the models and large scenario s...
详细信息
The Extended Air Defense Testbed (EADTB), is a comprehensive, high- and mixed-level-of-detail, environment for modeling weapon system entities and interactions. Due to the complexity of the models and large scenario sizes, in its current single-threaded form, EADTB is limited in run-time speed. Our goal is to speed up the simulation without re-architecture or re-implementation of the models which comprise 1.76 million lines of Ada code, and without altering model behavior or compromising repeatability and causality. Our work demonstrates that the use of optimistic scheduling techniques and its derivatives, offers the best alternative for object-based systems like EADTB. Specifically we have retrofitted and integrated the same representative pseudo-EADTB prototype with two different object-oriented optimistic scheduling engines (SPEEDES and TEMPO/Thema). We discuss the required architectural and behavioral features of a simulation to allow this retrofit, the issues of C++ to Ada language interfaces, and the employment of the basic services of the optimistic scheduling engines in this environment. Experimental results suggest that order-of-magnitude speed-up is feasible through parallelization, and is scalable to larger experiments simply by adding hardware.
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for collaborative computational science, the c...
详细信息
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for collaborative computational science, the computer code and supporting infrastructure itself becomes the collaborating instrument, just as an accelerator becomes the collaborating tool for large numbers of distributed researchers in particle physics. The design of this "collaboratory" allows many users, with very different areas of expertise, to work coherently together, on distributed computers around the world. Different supercomputers may be used separately, or for problems exceeding the capacity of any single system, multiple supercomputers may be networked together through high speed gigabit networks. Central to this collaboratory is a new type of community simulation code, called "Cactus". The scientific driving force behind this project is the simulation of Einstein's equations for studying black holes, gravitational waves, and neutron stars, which has brought together researchers in very different fields from many groups around the world to make advances in the study of relativity and astrophysics. But the system is also being developed to provide scientists and engineers, without expert knowledge of parallel or distributed computing, mesh refinement, and so on, with a simple framework for solving any system of partial differential equations on many parallel computer systems, from traditional supercomputers to networks of workstations.
There are at least three major obstacles thwarting wide-spread adoption of parallel discrete-event simulation (a) lack of need, (b) lack of tools, (c) lack of predictability in behavior and performance. The plain trut...
ISBN:
(纸本)9780769501550
There are at least three major obstacles thwarting wide-spread adoption of parallel discrete-event simulation (a) lack of need, (b) lack of tools, (c) 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 re-search efforts, and simply don't 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 endevour, with performance results very much dependent on implementation details and model characteristics.
Most successful examples of parallelsimulation models were developed for parallel execution, from the beginning. A number of simulation models are designed only for sequential simulation, even in languages like PARSE...
ISBN:
(纸本)9780769501550
Most successful examples of parallelsimulation models were developed for parallel execution, from the beginning. A number of simulation models are designed only for sequential simulation, even in languages like PARSEC, that support both sequential and parallelsimulation algorithms. Converting such simulation models to a form that yields good performance with a parallel implementation can be non-trivial. In this paper we describe a case study showing this conversion process for a simulation model of replicated file systems. The details of the major steps taken in converting the simulation into a parallelsimulation are presented: correctness changes; performance changes such as communication topology simplification and lookahead specification; and modeling changes to eliminate performance bottlenecks. The details and performance improvements of each step are presented in this paper.
Between 1994 and 1997, researchers at Southwest Research Institute (SwRI) investigated methods for distributing parallel computation and data visualization under the support of an internally funded Research Initiative...
详细信息
Between 1994 and 1997, researchers at Southwest Research Institute (SwRI) investigated methods for distributing parallel computation and data visualization under the support of an internally funded Research Initiative Program entitled the Advanced Visualization Technology Project (AVTP). A hierarchical data cache architecture was developed to provide a flexible interface between the modeling or simulation computational processes and data visualization programs. Compared to conventional post facto data visualization approaches, this data cache structure provides many advantages including simultaneous data access by multiple visualization clients, comparison of experimental and simulated data, and visual analysis of computer simulation as computation proceeds. However, since the data cache was resident on a single workstation, this approach did not address the issue of scalability of methods for avoiding the data storage bottleneck by distributing the data across multiple networked workstations. Scalability through distributed database approaches is being investigated as part of the Applied Visualization using Advanced Network Technology Infrastructure (AVANTI) project. This paper describes a methodology currently under development that is intended to avoid bottlenecks that typically arise as the result of data consumers (e.g. visualization applications) that must access and process large amounts of data that has been generated and resides on other hosts, and which must pass through a central data cache prior to being used by the data consumer.
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...
ISBN:
(纸本)9780769501550
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. This paper explores the design and implementation issues involved in exploiting this new platform for Time Warp simulations. Specifically, this paper presents 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.
暂无评论