Topological Properties of Hypercubes
IEEE Transactions on Computers
On Embedding Rectangular Grids in Hypercubes
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
IEEE Transactions on Computers
Embedding meshes on the star graph
Journal of Parallel and Distributed Computing
Graph Problems on a Mesh-Connected Processor Array
Journal of the ACM (JACM)
Sorting on a mesh-connected parallel computer
Communications of the ACM
IEEE Transactions on Parallel and Distributed Systems
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
The Hyper-deBruijn Networks: Scalable Versatile Architecture
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Design and analysis of product networks
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Reliable broadcasting in product networks in the presence of faulty nodes
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Topological Properties of OTIS-Networks
IEEE Transactions on Parallel and Distributed Systems
On the Performance of Parallel Matrix Factorisation on the Hypermesh
The Journal of Supercomputing
Hypermeshes: implementation and performance
Journal of Systems Architecture: the EUROMICRO Journal
Constructing Edge-Disjoint Spanning Trees in Product Networks
IEEE Transactions on Parallel and Distributed Systems
On the topological properties of the arrangement-star network
Journal of Systems Architecture: the EUROMICRO Journal
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
Sparsest cuts and concurrent flows in product graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
IEEE Transactions on Computers
The necklace-hypercube: a well scalable hypercube-based interconnection network for multiprocessors
Proceedings of the 2005 ACM symposium on Applied computing
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel 3-Dimensional DCT Computation on k-Ary n-Cubes
HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
OTIS-star an attractive alternative network
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Fault diameter of Cartesian product graphs
Information Processing Letters
Performance modeling of Cartesian product networks
Journal of Parallel and Distributed Computing
Efficient grid on the OTIS-Arrangment network
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
A finite automata approach to modeling the cross product of interconnection networks
Mathematical and Computer Modelling: An International Journal
Structural Outlooks for the OTIS-Arrangement Network
International Journal of Grid and High Performance Computing
Hi-index | 0.01 |
We study the cross product as a method for generating and analyzing interconnection network topologies for multiprocessor systems. Consider two interconnection graphs G1 and G2 each with some established properties such as symmetry, low degree and diameter, scalability, simple optimal routing, recursive structure (partitionability), fault tolerance, existence of node-disjoint paths, low cost embedding, and efficient broadcasting. We investigate and evaluate the corresponding properties for the cross product of G1 and G2 based on the properties of G1 and those of G2. We also give a mathematical characterization of product families of graphs which are closed under the cross product operation. This investigation is useful in two ways. On one hand, it gives a new tool for further studying some of the known interconnection topologies, such as the hypercube and the mesh, which can be defined using the cross product operation. On the other hand, it can be used in defining and evaluating new interconnection graphs using the cross product operation on known topologies.