The specification of data parallel algorithms
โ Scribed by Michael D. Rice; Stephen B. Seidman; Pearl Y. Wang
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 208 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
โฆ Synopsis
Several algorithms that illustrate fundamental data parallel operations and the implementation of virtual topologies in terms of hypercuhe operations are given. A geometric induction principle is developed and used for proving the correctness of these algorithms. The algorithms show how an elementary SIMD language can he used to formally specify and verify data parallel algorithms. o 1990Academic PUSS, IX.
๐ SIMILAR VOLUMES
The performance of the Knuth-Eve algorithm for data parallel evaluation of univariate polynomials of degree 8, 16 and 32 has been systematically compared with that of the classical Newton-Homer algorithm using three vector processors and three processor arrays. Significant performance improvements h
This paper describes some parallel processing algorithms for the analysis of twodimensional electrophoresis images. One of the largest processor arrays in the world. CLIP4, at University College London, was used in the research. The paper concentrates on algorithms using CLIP4 for querying the data
## Abstract One of the most commonly used means to characterize potential energy surfaces of reactions and chemical systems is the Hessian calculation, whose analytic evaluation is computationally and memory demanding. A new scalable distributed data analytic Hessian algorithm is presented. Feature