Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A minimum area VLSI network for O(logn) time sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A logarithmic time sort for linear size networks
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI
An Architecture for Bitonic Sorting with Optimal VLSI Performnance
IEEE Transactions on Computers
A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
How to share memory in a distributed system
Journal of the ACM (JACM)
Aspects of information flow in VLSI circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Scans as Primitive Parallel Operations
IEEE Transactions on Computers
Logarithmic time cost optimal parallel sorting is not yet fast in practice!
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
A Parallel Time/Hardware Tradeoff T.H=O(2/sup n/2/) for the Knapsack Problem
IEEE Transactions on Computers
An O(log N) deterministic packet-routing scheme
Journal of the ACM (JACM)
The de Bruijn multiprocessor network: a versatile sorting network
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube
IEEE Transactions on Parallel and Distributed Systems
A New Method of image Compression Using Irreducible Covers of Maximal Rectangles
IEEE Transactions on Software Engineering
A minimum area VLSI network for O(logn) time sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Contemplate sorting with columnsort
Proceedings of the 35th SIGCSE technical symposium on Computer science education
A scalable VLSI speed/area tunable sorting network
Journal of Systems Architecture: the EUROMICRO Journal
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
Recursion and parallel algorithms in geometric modeling problems
Cybernetics and Systems Analysis
The system of common algorithmic space to create visual models of phenomena and processes
Proceedings of the International Conference on Applications of Computer and Information Sciences to Nature Research
A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
On the complexity of min-max sorting networks
Information Sciences: an International Journal
Implementing Sorting Networks with Spiking Neural P Systems
Fundamenta Informaticae
A decomposition for in-place matrix transposition
Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming
| Hi-index | 0.01 |
In this paper, we prove tight upper and lower bounds on the number or processors, information transfer, wire area and time needed to sort N numbers in a bounded-degree fixed-connection network. Our most important new results are: 1) the construction of an O(N))-node bounded-degree network capable of sorting N numbers in O(log N) word steps, 2) a proof that any network capable of sorting N(7 log N)-bit numbers in T bit-steps requires area A where AT2≥ &Ohgr;(N2log2N), and 3) the construction of a “small-constant-factor” bounded-degree network that sorts N &thgr;(log N)-bit numbers in T &equil; &thgr;(log N) bit steps with A &equil; &thgr;(N2) area.