๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some Multigrid Algorithms for Elliptic Problems on Data Parallel Machines

โœ Scribed by Bandy, V. A.; Dendy, J. E.; Spangenberg, W. H.

Book ID
118188917
Publisher
Society for Industrial and Applied Mathematics
Year
1998
Tongue
English
Weight
531 KB
Volume
19
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Data Parallel Algorithm for Solving th
A Data Parallel Algorithm for Solving the Region Growing Problem on the Connection Machine
โœ N. Copty; S. Ranka; G. Fox; R.V. Shankar ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 696 KB

Region growing is a general technique for image segmentation, where image characteristics are used to group adjacent pixels together to form regions. This paper presents a parallel algorithm for solving the region growing problem based on the split-andmerge approach, and uses it to test and compare

A network parallel genetic algorithm for
A network parallel genetic algorithm for the one machine sequencing problem
โœ M.K. Mayer ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 626 KB

This paper presents a network parallel genetic algorithm for the one machine sequencing problem. It examines a parallel genetic algorithm in which processors exchange their best solution found at periodic intervals and the case when no exchange is performed. The network parallel genetic algorithm is