Because it has 0(N5) operations, a low computation to data transfer ratio, and is a compact piece of code, the four-index transformation is a good test case for parallel algorithm development of electronic structure calculations. We present an algorithm primarily designed for distributed-memory mach
Parallel computation of fourier transform on distributed memory computer system
β Scribed by Yihui Yan; Qingfeng Hu; Xinfang He
- Publisher
- Wuhan University
- Year
- 1996
- Tongue
- English
- Weight
- 194 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1007-1202
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O(N a ), where 2 < a [ 3. We show that such an algorithm can be parallelized on a distributed memory parallel computer (DMPC) in O(log N) time by using N a /log N processors. Such a parallel
A parallel distributed implementation of the second-order Mdler-Plesset perturbation theory method, widely used in quantum chemistry, is presented. Parallelization strategy and performance for the HONDO quantum chemistry program running on a network of Unix computers are also discussed. Superlinear
A parallel implementation of the computation of RHF energy second derivatives with respect to the nuclear coordinates is described. The algorithm and organization of the code are described in detail on the most computationally demanding steps with special emphasis on the integral transformation code
In this paper, we examine three general classes of space-sharing scheduling policies under a workload representative of large-scale scientific computing. These policies differ in the way processors are partitioned among the jobs as well as in the way jobs are prioritized for execution on the partiti