Coarse grained gather and scatter operations with applications

DOI10.1016/J.JPDC.2004.07.002MaRDI QIDQ705577zbMATH OpenOpenAlexFDO

Authors Laurence Boxer, Russ Miller

Publication date 31 January 2005

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2004.07.002

zbMATH Keywords

Hausdorff metricConvex hullParallel prefixCoarse grained parallel computerConnected componentDigital pictureDistance transformScaleable parallel algorithmSemigroup operationString matching

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Parallel algorithms in computer science (68W10)

Recommendations

• Coarse grained parallel selection
• An efficient parallel algorithm for the single function coarsest partition problem
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• String search in coarse-grained parallel computers
• Scalable parallel algorithms for geometric pattern recognition

Cited in

(4)

• Efficient coarse grained data distributions and string pattern matching
• Coarse grained parallel selection
• Operational Characterization of Scattered MCFLs
• Beyond the Hausdorff metric in digital topology

This page was built for publication: Coarse grained gather and scatter operations with applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705577)