Highly parallel machines needed to solve compute-intensive scientific applications are based on the distribution of physical memory across the compute nodes. The drawback of such systems is the necessity to write applications in the message passing programming model. Therefore, a lot of research is
Parallel evolutionary algorithms based on shared memory programming approaches
✍ Scribed by J. L. Redondo; I. García; P. M. Ortigosa
- Book ID
- 106539530
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 351 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0920-8542
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Wright K., Parallel algorithms for QR decomposition on a shared memory multiprocessor, Parallel Computing 17 (1991) 779-790. Various parallel implementations of algorithms for the QR decomposition of a matrix are compared using shared memory multiprocessors. Algorithms based on both Givens and Hous
A parallel algorithm for four-index transformation and MP2 energy evaluation, Ž . for distributed memory parallel MIMD machines is presented. The underlying serial algorithm for the present parallel effort is the four-index transform. The scheme works through parallelization over AO integrals and, t