Space and time complexities of balanced sorting on processor arrays

DOI10.1016/0885-064X(90)90028-CzbMath0718.68043MaRDI QIDQ2639641

Ferng-Ching Lin, Jiann-Cherng Shieh

Publication date: 1990

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

zbMATH Keywords

processor arraysbalanced sorting

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Parallel Sorting with Serial Memories
• Systolic Sorting on a Mesh-Connected Network
• Sorting on a mesh-connected parallel computer
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Unnamed Item

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