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
Evaluating recursive filters on distributed memory parallel computers
✍ Scribed by Stpiczyński, Przemysław
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 112 KB
- Volume
- 22
- Category
- Article
- ISSN
- 1069-8299
- DOI
- 10.1002/cnm.867
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper describes the parallel implementation of a numerical model for the simulation of problems from fluid dynamics on distributed memory multiprocessors. The basic procedure is to apply a fully explicit upwind finite difference approximation on a staggered grid. A theoretical time complexity a
We present a new fast and scalable matrix multiplication algorithm called DIMMA (distribution-independent matrix multiplication algorithm) for block cyclic data distribution on distributed-memory concurrent computers. The algorithm is based on two new ideas; it uses a modified pipelined communicatio
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
Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr