A time-space optimal parallel sorting on a hypercube

DOI10.1007/BF02900871MaRDI QIDQ4229564zbMATH OpenFDO

Authors Jianxian Qi

Publication date 23 August 1999

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

zbMATH Keywords

hypercubeparallel sorting algorithm

Mathematics Subject Classification ID

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3848585 (Why is no real title available?)
• scientific article; zbMATH DE number 4074508 (Why is no real title available?)
• An efficient parallel sorting algorithm for shared memory multiprocessors
• Linear sorting with O(log n) processors
• Optimal Sorting Algorithms for Parallel Computers
• Optimal VLSI sorting with reduced number of processors
• Parallel sorting by regular sampling
• Time-space optimal parallel merging and sorting

Cited in

(4)

• Deterministic sorting in nearly logarithmic time on the hypercube and related computers
• Space and time complexities of balanced sorting on processor arrays
• scientific article; zbMATH DE number 4064478 (Why is no real title available?)
• Cubesort: A parallel algorithm for sorting N data items with S-sorters

This page was built for publication: A time-space optimal parallel sorting on a hypercube

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