Systolic Sorting on a Mesh-Connected Network
From MaRDI portal
Recommendations
Cited in
(25)- Systolic sorting in a sequential input/output environment
- A function for evaluating the computing time of a bubbling system
- A VLSI partition algorithm
- Sorting in constant number of row and column phases on a mesh
- Time lower bounds for parallel sorting on a mesh-connected processor array
- VLSI-sorting evaluated under the linear model
- Optimal routing algorithms for mesh-connected processor arrays
- Indexing functions and time lower bounds for sorting on a mesh-connected computer
- Efficient algorithms for parallel sorting on mesh multicomputers
- Processor-efficient sparse matrix-vector multiplication
- A unified \(O(\log N)\) and optimal sorting vector algorithm
- Space and time complexities of balanced sorting on processor arrays
- Parallel merging on the instruction systolic array
- A Minimum Area VLSI Network for O(log n) Time Sorting
- An Architecture for Bitonic Sorting with Optimal VLSI Performnance
- Sorting on OTIS-Networks
- scientific article; zbMATH DE number 3954290 (Why is no real title available?)
- Parallel sorting in two-dimensional VLSI models of computation
- Systolic s/sup 2/-way merge sort is optimal
- scientific article; zbMATH DE number 4126713 (Why is no real title available?)
- A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors
- scientific article; zbMATH DE number 1156609 (Why is no real title available?)
- Simulating the Bitonic Sort Using P Systems
- Sorting numbers using limited systolic coprocessors
- Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays
This page was built for publication: Systolic Sorting on a Mesh-Connected Network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3681947)