An efficient implementation of priority queues using fixed-sized systolic coprocessors

DOI10.1016/0020-0190(93)90026-6zbMath0778.68030OpenAlexW2074158516MaRDI QIDQ685514

Jyh-Jong Tsay

Publication date: 9 January 1994

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

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90026-6

zbMATH Keywords

systolic arraypriority queuesDELETEEXTRACT-MININSERT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Cites Work

• Sorting numbers using limited systolic coprocessors
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• On the parallel-decomposability of geometric problems
• An On-Chip Compare/Steer Bubble Sorter
• Sorting n objects with a k-sorter