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

DOI10.1007/BF01758752MaRDI QIDQ1187201zbMATHFDO

Authors Jorge L. C. Sanz, Robert Cypher

Publication date 28 June 1992

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

hypercubesparallel algorithmsroutingdivide-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)

Recommendations

• Efficient parallel prefix algorithms on multiport message-passing systems
• A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
• scientific article; zbMATH DE number 4037239
• scientific article; zbMATH DE number 4074468
• scientific article; zbMATH DE number 17431

Cites work

• scientific article; zbMATH DE number 3900666 (Why is no real title available?)
• An O(logn) parallel connectivity algorithm
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Hypercube and shuffle-exchange algorithms for image component labeling
• Mesh computer algorithms for computational geometry
• Multidimensional divide-and-conquer
• Optimal Rearrangeable Multistage Connecting Networks
• Parallel Algorithms to Set Up the Benes Permutation Network
• Parallel Processing with the Perfect Shuffle
• Parallel permutation and sorting algorithms and a new generalized connection network
• Ultracomputers

Cited in

(9)

• A generalized parallel prefix sums algorithm for arbitrary size arrays
• Dynamic computational geometry on meshes and hypercubes
• Distributed evaluation of an iterative function for all object pairs on an SIMD hypercube
• Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers
• Compression using efficient multicasting
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers
• Efficient parallel prefix algorithms on multiport message-passing systems
• Vectorized search for single clusters

This page was built for publication: Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers

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