A unified \(O(\log N)\) and optimal sorting vector algorithm

DOI10.1007/BF02948343zbMath0845.68028MaRDI QIDQ1907067

Qingshi Gao

Publication date: 15 September 1996

Published in: Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

SIMD multi-processor systemvector sorting algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Uses Software

• SMMP

Cites Work

• Unnamed Item
• Unnamed Item
• Constant time sorting on a processor array with a reconfigurable bus system
• Sorting in \(c \log n\) parallel steps
• Sorting on PRAMs with reconfigurable buses
• A Minimum Area VLSI Network for O(log n) Time Sorting
• Tight Bounds on the Complexity of Parallel Sorting
• Parallelism in Comparison Problems
• Bounds to Complexities of Networks for Sorting and for Switching
• Sorting on a mesh-connected parallel computer
• New Parallel-Sorting Schemes
• Fast parallel sorting algorithms
• Data Manipulating Functions in Parallel Processors and Their Implementations
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations

This page was built for publication: A unified \(O(\log N)\) and optimal sorting vector algorithm