Product networks: a family of symmetric interconnection networks from a group model

Dilip Sarkar, Wing Tong

Research output: Contribution to journalArticle

Abstract

Akers and Krishnamurthy developed a formal group-theoretic model, Cayley graph model, for designing and analyzing processor/communication interconnection networks. Using this model they have developed two classes of interconnection networks, the star graph and the pancake graph. Analysis has shown that star graphs are markedly superior to the widely used n-cube. In this paper, applying the concept of internal direct product of groups, we study a family of interconnection networks-product networks. Both the n-cube and the star graph are member of this family of networks. We study such properties of product networks as degree, diameter, connectivity, and fault-tolerance. We show that product networks are hierarchical in structure. Using this hierarchical property we have developed an optimal one-to-all broadcasting algorithm for the product graph.

Original languageEnglish (US)
Pages (from-to)183-200
Number of pages18
JournalInternational Journal of Computer Mathematics
Volume73
Issue number2
DOIs
StatePublished - Jan 1 1999

    Fingerprint

Keywords

  • Interconnection networks
  • One-to-all broadcasting
  • Parallel algorithms
  • Parallel machines
  • Product graphs
  • Star graphs
  • Time complexity

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics

Cite this