Distributed-memory message-passing machines deliver scalable performance but are difficult to program. Shared-memory machines, on the other hand, are easier to program but obtaining scalable performance with large number of processors is difficult. Recently, scalable machines based on logically shar
Parallel Algorithms for Perceptual Grouping on Distributed Memory Machines
β Scribed by Yongwha Chung; Cho-Li Wang; Viktor K. Prasanna
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 923 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper reports our work on parallelizing an algorithm computing GrΓΆbner bases on a distributed memory parallel machine. When computing GrΓΆbner bases, the efficiency of computation is dominated by the total number of S-polynomials. To decrease the total number of S-polynomials it is necessary to
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
Many parallel algorithms and library routines for computer vision and image processing (CVIP) tasks on distributed-memory multiprocessors are available. The typical image distribution may use column, row, and block based mapping. Integrating a set of library routines for a CVIP application requires
This paper introduces an architecture-independent, hierarchical approach to algorithm design on distributed-memory architectures, in contrast to the current trend of tailoring algorithms towards specific architectures. We show that, rather surprisingly, this new approach can achieve uniformity witho