A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Uniform generation of random regular graphs of moderate degree
Journal of Algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Interconnection networks: regularity and richness
Interconnection networks: regularity and richness
Mapping unstructured grid computations to massively parallel computers
Mapping unstructured grid computations to massively parallel computers
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
A Case for NOW (Networks of Workstations)
IEEE Micro
DCC Linear Congruential Graphs: A New Class of Interconnection Networks
IEEE Transactions on Computers
HPCN Europe 1996 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Synthesis of Interconnection Networks: A Novel Approach
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Interconnection network design based on packaging considerations
Interconnection network design based on packaging considerations
Networking issues in distributed real-time systems
Networking issues in distributed real-time systems
Generating Random Regular Graphs Quickly
Combinatorics, Probability and Computing
Graph Theory With Applications
Graph Theory With Applications
Profiling and mapping of parallel workloads on network processors
Proceedings of the 2005 ACM symposium on Applied computing
Designing efficient irregular networks for heterogeneous systems-on-chip
Journal of Systems Architecture: the EUROMICRO Journal
Analytic modeling of network processors for parallel workload mapping
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
Synthesizing networks that satisfy multiple requirements, such as high reliability, low diameter, good embeddability, etc., is a difficult problem to which there has been no completely satisfactory solution. In this paper, we present a simple, yet very effective, approach to this problem. The crux of our approach is a filtration process that takes as input a large set of randomly generated graphs and filters out those that do not meet the specified requirements. Our experimental results show that this approach is both practical and powerful. The use of random regular networks as the raw material for the filtration process was motivated by their surprisingly good performance with regard to almost all properties that characterize a good interconnection network. This paper provides results related to the generation of networks that have low diameter, high fault tolerance, and good embeddability. Through this, we show that the generated networks are serious competitors to several traditional well-known networks. We also explore how random networks can be used in a packaging hierarchy and comment on the scope of application of these networks.