Open AccessBook
Computational Aspects of Vlsi
About:
The article was published on 1984-01-01 and is currently open access. It has received 862 citations till now. The article focuses on the topics: Very-large-scale integration.read more
Citations
More filters
Journal ArticleDOI
A logarithmic time sort for linear size networks
John H. Reif,Leslie G. Valiant +1 more
TL;DR: A randomized algorithm that sorts on an N- node network with constant valence in O(log N) time with probability at least 1 - N - “α” - “ α” for all large enough items.
Journal ArticleDOI
Group action graphs and parallel architectures
TL;DR: An algebraic framework is developed that exposes the structural kinship among the deBruijn, shujCfle-exchange, butterjy, and cube-connected cycles networks and shows a family of "leveled" algorithms which run as efficiently on T/ as they do on (the much larger) G.
Proceedings ArticleDOI
Tight bounds on the complexity of parallel sorting
TL;DR: Tight upper and lower bounds are proved on the number of processors, information transfer, wire area, and time needed to sort N numbers in a bounded-degree fixed-connection network.
Book
Communication Complexity and Parallel Computing
TL;DR: This book is written as a textbook for undergraduate and graduate students and provides a careful explanation of the subject as well as motivation for further research.
Journal ArticleDOI
Hierarchical cubic networks
Kanad Ghose,K. R. Desai +1 more
TL;DR: Simulation of uniform and localized traffic patterns reveal that the normalized average internode distances in a HCN are better than in a comparable hypercube, a fact that has positive ramifications on the implementation of HCN-connected systems.