Parallel sorting in two-dimensional VLSI models of computation

DOI10.1109/12.16500MaRDI QIDQ3823790zbMATH OpenOpenAlexFDO

Authors Isaac D. Scherson, Sandeep Sen

Publication date 1989

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ff8f48ab47836fc2c9364a71522b82f8a9c8579a

zbMATH Keywords

parallel sortingmesh-connected arraysVLSI complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99) Theory of computing (68Q99)

Recommendations

• Systolic Sorting on a Mesh-Connected Network
• A Minimum Area VLSI Network for O(log n) Time Sorting
• Parallel Sorting with Serial Memories
• Optimal VLSI circuits for sorting
• A unified algorithm for sorting on multidimensional mesh-connected processors

Cited in

(9)

• Time-complexity of shear sort
• VLSI Sorting with Reduced Hardware
• A unified algorithm for sorting on multidimensional mesh-connected processors
• On the performance of networks with multiple busses
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
• Optimal VLSI circuits for sorting
• k-k Sorting on the multi-mesh
• Two parallel processors with coupled inputs

This page was built for publication: Parallel sorting in two-dimensional VLSI models of computation

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