Over the past decade, techniques for parallel and distributed discrete-event simulation have been developed largely within the academic research community. The advent of cluster computing and desktop multiprocessors has now made it feasible to bring these results to bear on the simulation of large,
Parallel Discrete Event Simulation on SIMD Computers
β Scribed by R. Ayani; B. Berkman
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 579 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
β¦ Synopsis
A simulator based on a synchronous parallel simulation scheme is developed on an SIMD computer, a connection machine (CM-2) with (8 \mathrm{~K}) processors. Multistage interconnection networks of different sizes ( 2 to 16 stages) are simulated. Two categories of experiments are performed: symmetric and asymmetric workloads. Four metrics are used to evaluate performance of the simulator: degree of detected parallelism, degree of potential parallelism, speedup, and efficiency. The obtained results demonstrate good speedups (over 2000) in some cases. O 1993 Academic Press. Inc.
π SIMILAR VOLUMES
A useful discrete-event simulation environment should support component-level reuse, integration of graphical tools, and scalable performance. The JTED framework (http://www.cooperate.com/JTED) demonstrates that Java can serve as the basis for constructing very large models that achieve these goals.
This paper studies the termination problem for a distributed discrete event simulation in a computing environment where message sending does not preserve FIFO property (i.e., the messages may not be delivered in the order they are sent). The distributed simulation considered is synchronized by a rol
Java is a very promising language for use in the simulation of physical models due to its objectoriented nature, portability, robustness and support for multithreading. This paper presents JWarp, a Java library for discrete-event parallel simulations. It is based on an optimistic model for synchroni
Dedicated to the late M. R. B. Clarke SUMMARY Efficient algorithms for estimating the coefficient parameters of the ordinary linear model on a massively parallel SIMD computer are presented. The numerical stability of the algorithms is ensured by using orthogonal transformations in the form of House