Sorting numbers using limited systolic coprocessors

DOI10.1016/0020-0190(87)90109-8MaRDI QIDQ579941zbMATH OpenOpenAlexFDO

Authors 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

parallel computationsortingprobabilistic algorithmrandom access machinesystolic coprocessors

Mathematics Subject Classification ID

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

Recommendations

• Parallel Sorting with Serial Memories
• Systolic sorting in a sequential input/output environment
• Sorting in rounds
• Systolic Sorting on a Mesh-Connected Network
• Probabilistic Parallel Algorithms for Sorting and Selection

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• Routing, merging, and sorting on parallel models of computation
• Sorting by distributive partitioning

Cited in

(3)

• Systolic sorting in a sequential input/output environment
• An efficient implementation of priority queues using fixed-sized systolic coprocessors
• On the parallel-decomposability of geometric problems

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

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