## Abstract

We study the cross product as a method for generating and analyzing interconnection network topologies for multiprocessor systems. Consider two interconnection graphs G_{1} and G_{2} 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 G_{1} and G_{2} based on the properties of G_{1} and those of G_{2}. 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 language | English |
---|---|

Pages (from-to) | 109-118 |

Number of pages | 10 |

Journal | IEEE Transactions on Parallel and Distributed Systems |

Volume | 8 |

Issue number | 2 |

DOIs | |

Publication status | Published - 1997 |

## 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