Pipelined parallel prefix computations, and sorting on a pipelined hypercube

DOI10.1006/JPDC.1993.1037MaRDI QIDQ2365584zbMATH OpenOpenAlexFDO

Authors Ernst W. Mayr, C. Greg Plaxton

Publication date 29 June 1993

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

Full work available at URL https://semanticscholar.org/paper/827bd560dfa4b5c644d3ba088e23dcb1dc2ede9b

zbMATH Keywords

complete binary treedata distributionhypercubemultiway merge sortprefix operationshuffle-exchange

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4064478
• Radix sort on the hypercube
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers
• Cubesort: A parallel algorithm for sorting N data items with S-sorters

Cited in

(5)

• Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers
• Divide-and-conquer algorithms on the hypercube
• Improved fault-tolerance sorting algorithm in hypercubes
• Mapping a functional notation for parallel programs onto hypercubes
• Pipelined search on coarse grained networks

This page was built for publication: Pipelined parallel prefix computations, and sorting on a pipelined hypercube

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