Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
From MaRDI portal
Publication:1187201
DOI10.1007/BF01758752zbMATH Open0766.68052MaRDI QIDQ1187201FDOQ1187201
Authors: Jorge L. C. Sanz, Robert Cypher 
Publication date: 28 June 1992
Published in: Algorithmica (Search for Journal in Brave)
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
hypercubesparallel algorithmsroutingdivide-and-conquer algorithmparallel computerSIMD computersclosest-pair problemdata-dependent parallel-prefix problemimage-component-labeling problemmultiple-prefix problem
Cites Work
- Multidimensional divide-and-conquer
- Parallel Processing with the Perfect Shuffle
- Title not available (Why is that?)
- An O(logn) parallel connectivity algorithm
- Optimal Rearrangeable Multistage Connecting Networks
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
- Hypercube and shuffle-exchange algorithms for image component labeling
- Parallel permutation and sorting algorithms and a new generalized connection network
- Ultracomputers
- Mesh computer algorithms for computational geometry
- Parallel Algorithms to Set Up the Benes Permutation Network
Cited In (9)
- Efficient parallel prefix algorithms on multiport message-passing systems
- Dynamic computational geometry on meshes and hypercubes
- Vectorized search for single clusters
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
- Compression using efficient multicasting
- A generalized parallel prefix sums algorithm for arbitrary size arrays
- 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
- Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers
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)
