A Group-Theoretic Model for Symmetric Interconnection Networks

  • Authors:

  • S. B. Akers;B. Krishnamurthy

  • Affiliations:

  • Univ. of Massachusetts, Amherst;Tektronix Labs., Beaverton, OR

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1989

Quantified Score

Hi-index 15.07

Visualization

Abstract

The authors develop a formal group-theoretic model, called the Cayley graph model, for designing, analyzing, and improving such networks. They show that this model is universal and demonstrate how interconnection networks can be concisely represented in this model. It is shown that this model enables the authors to design networks based on representations of finite groups. They can then analyze these networks by interpreting the group-theoretic structure graph theoretically, Using these ideas, and motivated by certain well-known combinatorial problems, they develop two classes of networks called star graphs and pancake graphs. These networks are shown to have better performance than previous networks.