Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
The Area-Time Complexity of Binary Multiplication
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing connected components on parallel computers
Communications of the ACM
Sorting on a mesh-connected parallel computer
Communications of the ACM
An efficient data structure for dynamic memory management
Journal of Systems and Software
New layouts for the shuffle-exchange graph(Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A model of computation for VLSI with related complexity results
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A generalization and proof of the Aanderaa-Rosenberg conjecture
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
A complexity theory for VLSI
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
New lower bound techniques for VLSI
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Evaluation of On-Chip Static Interconnection Networks
IEEE Transactions on Computers
A VLSI Implementation of the Simplex Algorithm
IEEE Transactions on Computers
Optimal Graph Algorithms on a Fixed-Size Linear Array
IEEE Transactions on Computers
On the Dynamic Initialization of Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
IEEE Transactions on Computers
OTIS-MOT: an efficient interconnection network for parallel processing
The Journal of Supercomputing
Hi-index | 14.99 |
In this paper we describe two interconnection networks for parallel processing, namely the orthogonal trees network and the orthogonal tree cycles (OTN and OTC). Both networks are suitable for VISI implementation and have been analyzed using Thompson's model of VLSI. While the OTN and OTC have time performances similar to fast networks such as the perfect shuffle network (PSN), the cube comnected cycles (CCC), etc., they have substantially better area * time2 performances for a number of matrix and graph problems. For instance, the connected components and a minimal spanning tree of an undirected N-vertex graph can be found in 0(log4 N) time on the OTC with an area * time2 performance of 0(N2 log8 N) and 0(N2 log9 N) respectively. This is asymptoticaly much better than the performances of the CCC, PSN and Mesh. The OTC and OTN can be looked upon as general purpose parallel processors since a number of other problems such as sorting and DFT can be solved on them with an area * time2 performance matching that of other networks. Finally, programming the OTN and OTC is simple and they are also amenable to pipelining a series of problems.