Abstract
We introduce asymptotically optimal algorithms for gathering and scattering a small-to-moderate sized set of data on a coarse grained parallel computer. We use these operations to obtain efficient to optimal solutions to several fundamental problems in image processing and string matching (exact or approximate) for coarse grained parallel computers.
| Original language | English |
|---|---|
| Pages (from-to) | 1297-1310 |
| Number of pages | 14 |
| Journal | Journal of Parallel and Distributed Computing |
| Volume | 64 |
| Issue number | 11 |
| DOIs | |
| State | Published - Nov 2004 |
Keywords
- Coarse grained parallel computer
- Connected component
- Convex hull
- Digital picture
- Distance transform
- Hausdorff metric
- Parallel prefix
- Scaleable parallel algorithm
- Semigroup operation
- String matching
Fingerprint
Dive into the research topics of 'Coarse grained gather and scatter operations with applications'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver