Sep: A Fixed Degree Regular Network for MassivelyParallel Systems

  • Authors:
  • Shahram Latifi;Pradip K. Srimani

  • Affiliations:
  • University of Nevada. E-mail: latifi@ee.unlv.edu;Colorado State University. E-mail: srimani@cs.colostate.edu

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a family of regular Cayley network graphs of degreethree based on permutation groups for design of massivelyparallel systems. These graphs are shown to be based on theshuffle exchange operations, to have logarithmic diameter in thenumber of vertices, and to be maximally fault tolerant. Weinvestigate different algebraic properties of these networks(including fault tolerance) and propose a simple routing algorithm.These graphs are shown to be able to efficiently simulate or embedother permutation group based graphs; thus they seem to be veryattractive for VLSI implementation and for applications requiringbounded number of I/O ports as well as to run existing applicationsfor other permutation group based network architectures.