Radix sort on the hypercube

DOI10.1016/0020-0190(91)90226-8MaRDI QIDQ1178199zbMATH OpenOpenAlexFDO

Authors Giovanni Manzini

Publication date 26 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90226-8

zbMATH Keywords

hypercube network

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• Cubesort: A parallel algorithm for sorting N data items with S-sorters
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Parallel sorting revisited
• scientific article; zbMATH DE number 4064478

Cites work

• Efficient parallel algorithms for graph problems
• scientific article; zbMATH DE number 3481857 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Parallel Prefix Computation
• Ultracomputers

Cited in

(8)

• Data broadcasting and reduction, prefix computation, and sorting on reduced hypercube parallel computers
• Radix sort trees in the large
• An efficient permutation-based parallel algorithm for range-join in hypercubes
• Pipelined parallel prefix computations, and sorting on a pipelined hypercube
• Cubesort: A parallel algorithm for sorting N data items with S-sorters
• Power balance and apportionment algorithms for the United States Congress
• Partitioned parallel radix sort
• Rainbow sort: Sorting at the speed of light

This page was built for publication: Radix sort on the hypercube

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