Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays

DOI10.1016/0020-0190(90)90190-9zbMath0702.68054OpenAlexW2064404846MaRDI QIDQ915448

Yijie Han, Yoshihide Igarashi

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90190-9

zbMATH Keywords

sortingparallel computationtime lower boundsmesh-connected processor arrays

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)

Related Items

Indexing functions and time lower bounds for sorting on a mesh-connected computer

Cites Work

• Lower bounds for sorting on mesh-connected architectures
• Systolic Sorting on a Mesh-Connected Network
• Sorting on a mesh-connected parallel computer
• Unnamed Item
• Unnamed Item