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
Parallel image restoration on parallel and distributed computers
โ Scribed by A. Bevilacqua; E. Loli Piccolomini
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 308 KB
- Volume
- 26
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper we present a parallel application for image restoration. The problem is relevant in some application ยฎelds, such as medicine or astronomy, and has a very high computational complexity so that it is dicult to solve it on scalar computers. The algorithm is based on data parallelism, that is realized with an adaptive decomposition of the image spatial domain for a class of degradation functions. We discuss the implementation on a cluster of six workstations connected through Ethernet network and on a Cray T3E with 128 processors. The results obtained with dierent images and dierent number of tasks show good scalability and speed-up.
๐ SIMILAR VOLUMES
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
The calculation of physical quantities by lattice QCD simulations requires in some important cases the determination of the inverse of a very large matrix. In this article we describe how stochastic estimator methods can be applied to this problem, and how such techniques can be eciently implemented