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

Interconnection Networks
Star Graph
Stars
N-cube
Fault tolerance
Broadcasting
Product Graph
Formal Group
Telecommunication networks
Cayley Graph
Graph Model
Direct Product
Fault Tolerance
Communication Networks
Model
Connectivity
Internal
Family
Graph in graph theory

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

Product networks : a family of symmetric interconnection networks from a group model. / Sarkar, Dilip; Tong, Wing.

In: International Journal of Computer Mathematics, Vol. 73, No. 2, 01.01.1999, p. 183-200.

Research output: Contribution to journalArticle

@article{077846912e5e4818b6316b4254a01c99,
title = "Product networks: a family of symmetric interconnection networks from a group model",
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.",
keywords = "Interconnection networks, One-to-all broadcasting, Parallel algorithms, Parallel machines, Product graphs, Star graphs, Time complexity",
author = "Dilip Sarkar and Wing Tong",
year = "1999",
month = "1",
day = "1",
doi = "10.1080/00207169908804888",
language = "English (US)",
volume = "73",
pages = "183--200",
journal = "International Journal of Computer Mathematics",
issn = "0020-7160",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

TY - JOUR

T1 - Product networks

T2 - a family of symmetric interconnection networks from a group model

AU - Sarkar, Dilip

AU - Tong, Wing

PY - 1999/1/1

Y1 - 1999/1/1

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

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

KW - Interconnection networks

KW - One-to-all broadcasting

KW - Parallel algorithms

KW - Parallel machines

KW - Product graphs

KW - Star graphs

KW - Time complexity

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

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

U2 - 10.1080/00207169908804888

DO - 10.1080/00207169908804888

M3 - Article

VL - 73

SP - 183

EP - 200

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

SN - 0020-7160

IS - 2

ER -