Constant time sorting on a processor array with a reconfigurable bus system

DOI10.1016/0020-0190(90)90158-TzbMath0702.68060OpenAlexW1969477831MaRDI QIDQ915452

Gen-Huey Chen, Biing-Feng Wang, Ferng-Ching Lin

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)90158-t

zbMATH Keywords

reconfigurable bus systemsorting by ranking

Mathematics Subject Classification ID

Related Items (14)

A neural sorting network with O(1) time complexity ⋮ Reconfigurable meshes and image processing ⋮ HISTOGRAMMING ON A RECONFIGURABLE MESH COMPUTER∗ ⋮ MATRIX OPERATIONS USING ARRAYS WITH RECONFIGURABLE OPTICAL BUSES∗ ⋮ A unified \(O(\log N)\) and optimal sorting vector algorithm ⋮ Integer summing algorithms on reconfigurable meshes ⋮ Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model ⋮ Efficient minimum spanning tree algorithms on the reconfigurable mesh ⋮ Fast algorithms for lowest common ancestors on a processor array with reconfigurable buses ⋮ Simulations between two reconfigurable mesh models ⋮ Sorting on PRAMs with reconfigurable buses ⋮ Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems ⋮ PERMUTATION ROUTING AND SORTING ON THE RECONFIGURABLE MESH ⋮ Sorting and computing convex hulls on processor arrays with reconfigurable bus systems

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal parallel algorithms for computing convex hulls and for sorting
• The VLSI Complexity of Sorting
• Mesh-Connected Computers with Broadcasting
• Efficient parallel convex hull algorithms
• Bus automata and immediate languages

This page was built for publication: Constant time sorting on a processor array with a reconfigurable bus system