As part of the ongoing effort in creating a parallel benchmark suite for C 3 I (command, control, communication, and intelligence) applications, we implemented an important C 3 I application, the decision support systems (DSS), using a genetic algorithmic approach. In this paper, we present the stru
Implementation and performance of a binary lattice gas algorithm on parallel processor systems
β Scribed by F Hayot; M Mandal; P Sadayappan
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 670 KB
- Volume
- 80
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An automated version of the Verlet neighbor list algorithm in which the optimum neighbor list radius (SKIN) increases with the system size (N) shows an almost linear CPU time versus N dependence over the range 102 < N <i0 4. The algorithm's speed is comparable to that of a Link-Cell code (Grest et a
We describe a benchmark parallel version of the Van Slyke and Wets (1969) algorithm for two-stage stochastic programs and an implementation of that algorithm on the Sequent/Balance. We also report results of a numerical experiment using random test problems and our implementation. These performance
We show how a reconfigurable network of transputers can be used to serve as a fast neural computing machine. Software implementation and hardware configuration are presented. The individual updating of the neurons in the neural network is performed following the parallel synchronous or maximum field
In this study we propose a novel method to parallelize high-order compact numerical algorithms for the solution of three-dimensional PDEs in a space-time domain. For such a numerical integration most of the computer time is spent in computation of spatial derivatives at each stage of the Runge-Kutta