Sorting numbers using limited systolic coprocessors

DOI10.1016/0020-0190(87)90109-8zbMath0625.68043OpenAlexW1969844976MaRDI QIDQ579941

Jianyong Qiao, Sumit K. Garg

Publication date: 1987

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

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

zbMATH Keywords

sortingparallel computationprobabilistic algorithmrandom access machinesystolic coprocessors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (2)

On the parallel-decomposability of geometric problems ⋮ An efficient implementation of priority queues using fixed-sized systolic coprocessors

Cites Work

• Unnamed Item
• Routing, merging, and sorting on parallel models of computation
• Sorting by distributive partitioning

This page was built for publication: Sorting numbers using limited systolic coprocessors