𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimization and performance analysis of thinning algorithms on parallel computers

✍ Scribed by Stephan Heydorn; Peter Weidner


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
530 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

✦ Synopsis


Heydorn, S. and P. Weidner, Optimization and performance analysis of thinning algorithms on parallel computers, Parallel Computing 17 (1991) 17-27. This paper presents a concept for an implementation of different parallel thinning algorithms on parallel processors. The emphasis is put on a good parallelization using fine granularity and the simultaneous usage of vectorization_ Results and experiences are discussed which have been obtained on the supercomputers CRAY X-MP/416 and CRAY Y-MPS/832 by realizing this concept, applied to one particular algorithm.


πŸ“œ SIMILAR VOLUMES


Analysis of Multigrid Algorithms on Mass
✍ Lesley R. Matheson; Robert E. Tarjan πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 234 KB

We study the potential performance of multigrid algorithms running on massively parallel computers with the intent of discovering whether currently envisioned machines will provide an efficient platform for such algorithms. These algorithms substantially improve the performance of iterative methods

Performance analysis of algorithms on as
✍ R.H. Barlow; D.J. Evans; J. Shanehchi πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 323 KB

The paper will present a performance analysis of a 4-processor asynchronous parallel computer based on Texas Instruments 990/10 minicomputers, recently commissioned at Loughborough University. A description of the implementation of parallel computing on the system, which was originally 4 independent

Performance modeling and analysis of cor
✍ Wei-Ming Lin πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 330 KB

A performance analysis methodology for correlated parallel computations based on statistical theory is proposed. Divide-and-conquer strategy is widely used in solving problems in parallel by partitioning and allocating a number of given tasks to available computing resources. When the tasks exhibit

A C3I Parallel Benchmark Based on Geneti
✍ Subburajan Ponnuswamy; Minesh B. Amin; Rakesh Jha; David A. CastaΓ±on πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 305 KB

As part of the ongoing effort in creating a parallel benchmark suite for C 3 I (command, control, communication, and intelligence) applications, we implemented an important C 3 I application, the decision support systems (DSS), using a genetic algorithmic approach. In this paper, we present the stru