The cross product of interconnection networks

Khaled Day, Abdel Elah Ai-Ayyoub

Research output: Contribution to journalArticle

64 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)109-118
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Volume8
Issue number2
DOIs
Publication statusPublished - 1997

Fingerprint

Cross product
Interconnection Networks
Topology
Interconnection
Fault tolerance
Broadcasting
Graph in graph theory
Scalability
Product Family
Disjoint Paths
Multiprocessor Systems
Hypercube
Fault Tolerance
Network Topology
Routing
Costs
Mesh
Symmetry
Closed
Evaluate

Keywords

  • Broadcasting
  • Embedding
  • Interconnection networks
  • Parallel paths
  • Product networks
  • Routing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

The cross product of interconnection networks. / Day, Khaled; Ai-Ayyoub, Abdel Elah.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 2, 1997, p. 109-118.

Research output: Contribution to journalArticle

@article{083568df7d334e639fc31dca360ee07e,
title = "The cross product of interconnection networks",
abstract = "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.",
keywords = "Broadcasting, Embedding, Interconnection networks, Parallel paths, Product networks, Routing",
author = "Khaled Day and Ai-Ayyoub, {Abdel Elah}",
year = "1997",
doi = "10.1109/71.577251",
language = "English",
volume = "8",
pages = "109--118",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - The cross product of interconnection networks

AU - Day, Khaled

AU - Ai-Ayyoub, Abdel Elah

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

KW - Broadcasting

KW - Embedding

KW - Interconnection networks

KW - Parallel paths

KW - Product networks

KW - Routing

UR - http://www.scopus.com/inward/record.url?scp=0031076525&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031076525&partnerID=8YFLogxK

U2 - 10.1109/71.577251

DO - 10.1109/71.577251

M3 - Article

VL - 8

SP - 109

EP - 118

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 2

ER -