Space and time complexities of balanced sorting on processor arrays

DOI10.1016/0885-064X(90)90028-CMaRDI QIDQ2639641zbMATH OpenFDO

Authors Ferng-Ching Lin, Jiann-Cherng Shieh

Publication date 1990

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0885-064X(90)90028-C

zbMATH Keywords

balanced sortingprocessor arrays

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Tight Bounds on the Complexity of Parallel Sorting
• The Complexity of Parallel Sorting
• Parallel complexity of sorting problems
• Tight Comparison Bounds on the Complexity of Parallel Sorting
• A time-space optimal parallel sorting on a hypercube
• Fast parallel space allocation, estimation, and integer sorting
• Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
• Time lower bounds for parallel sorting on a mesh-connected processor array

Cites work

• Bitonic Sort on a Mesh-Connected Parallel Computer
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Parallel Sorting with Serial Memories
• Sorting on a mesh-connected parallel computer
• Systolic Sorting on a Mesh-Connected Network

Cited in

(1)

• Perfectly overlapped merging and sorting on a two-way linear array

This page was built for publication: Space and time complexities of balanced sorting on processor arrays

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