Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers

DOI10.1007/BF01758752zbMath0766.68052MaRDI QIDQ1187201

Jorge L. C. Sanz, Robert Cypher

Publication date: 28 June 1992

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmshypercubesroutingdivide-and-conquer algorithmparallel computerSIMD computersclosest-pair problemdata-dependent parallel-prefix problemimage-component-labeling problemmultiple-prefix problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Related Items

Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers ⋮ Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ Vectorized search for single clusters

Cites Work

• Unnamed Item
• Multidimensional divide-and-conquer
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Ultracomputers
• Parallel permutation and sorting algorithms and a new generalized connection network
• An O(logn) parallel connectivity algorithm
• Parallel Algorithms to Set Up the Benes Permutation Network
• Hypercube and shuffle-exchange algorithms for image component labeling
• Optimal Rearrangeable Multistage Connecting Networks
• Mesh computer algorithms for computational geometry
• Parallel Processing with the Perfect Shuffle