Design and analysis of product networks

Authors:
A. Youssef
Affiliations:
-
Venue:
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Year:
1995

Citing 0
Cited 13

The Cross Product of Interconnection Networks

IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks

IEEE Transactions on Parallel and Distributed Systems
A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes

ICPP '97 Proceedings of the international Conference on Parallel Processing
On the topological properties of the arrangement-star network

Journal of Systems Architecture: the EUROMICRO Journal
Comparing the Performance Parameters of Two Network Structures for Scalable Massively Parallel Processors

MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Node-ranking schemes for the star networks

Journal of Parallel and Distributed Computing
Incomplete k-ary n-cube and its derivatives

Journal of Parallel and Distributed Computing
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model

IEEE Transactions on Computers
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes

Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
Performance modeling of Cartesian product networks

Journal of Parallel and Distributed Computing
A finite automata approach to modeling the cross product of interconnection networks

Mathematical and Computer Modelling: An International Journal
Bisection (band)width of product networks with application to data centers

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a unified theory of Cartesian product networks is developed. Product networks (PN) include meshes, tori, and hypercubes among others. This paper studies the fundamental issues of topological properties, cost-performance ratio optimization, scalability, routing, embedding, and fault tolerance properties of PNs. In particular, the degree, diameter, average distance, connectivity, and node-symmetry of PNs are related to those of their constituent factor networks. Cost/performance analysis and comparison between different PNs, especially n-dimensional meshes/tori and n-dimensional r-ary hypercubes, are conducted, and the optimal trade-off between the number of dimensions and the size along each dimension are identified. Fast generic algorithms for point-to-point routing, broadcasting and permuting on PNs are designed, making use of the corresponding algorithms of the factor networks. Finally, efficient embeddings on PNs are constructed for linear arrays, rings, meshes, tori and trees.