Processor interconnection networks from Cayley graphs

DOI10.1016/0166-218X(92)90005-UzbMATH Open0782.68014MaRDI QIDQ1208451FDOQ1208451

Authors: Stephen T. Schibell, Richard M. Stafford 

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Recommendations

• New methods for using Cayley graphs in interconnection networks
• Two families of Cayley graph interconnection networks
• Graphs for small multiprocessor interconnection networks
• Trivalent Cayley graphs for interconnection networks
• Application of some graph invariants to the analysis of multiprocessor interconnection networks
• Theory and Applications of Models of Computation
• Interconnection Networks Based on a Generalization of Cube-Connected Cycles
• Construction of Hamiltonian circuits in Cayley graphs modeling multiprocessing computer systems
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• Some mathematical properties of cayley digraphs with applications to interconnection network design

zbMATH Keywords

Cayley graphspermutation grouproutingparallel computersMIMD machine

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Generators, relations, and presentations of groups (20F05) Mathematical problems of computer architecture (68M07)

Cites Work

• Graph theory
• Title not available (Why is that?)
• On Group Graphs and Their Fault Tolerance
• Small-diameter Cayley graphs for finite simple groups
• On the diameter of Cayley graphs of the symmetric group
• Title not available (Why is that?)
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Title not available (Why is that?)
• Permutations of bounded degree generate groups of polynomial diameter

Cited In (24)

• Vertex reconstruction in Cayley graphs
• Groups with a Cayley graph isomorphic to a hypercube
• Product networks:a family of symmetric interconnection networks from a group model
• Task assignment in Cayley interconnection topologies
• Cycles in the burnt pancake graph
• Title not available (Why is that?)
• Minimal sense of direction in regular networks
• Title not available (Why is that?)
• Trivalent Cayley graphs for interconnection networks
• Cayley graphs as classifiers for data mining: the influence of asymmetries
• Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks
• A Class of Arc-Transitive Cayley Graphs as Models for Interconnection Networks
• New methods for using Cayley graphs in interconnection networks
• Capillary graph-interfaces ``in-the-large
• Title not available (Why is that?)
• On reconstruction of normal edge-transitive Cayley graphs
• Finding \(k\) shortest paths in Cayley graphs of finite groups
• Cayley graphs
• A group-theoretic model for symmetric interconnection networks
• Using semidirect products of groups to build classes of interconnection networks
• Cayley graphs of groupoids and generalized fat-trees
• Concurrent flows and packet routing in Cayley graphs (Preliminary version)
• On two-sided Cayley graphs of semigroups and groups
• Group Action Graphs and Parallel Architectures

This page was built for publication: Processor interconnection networks from Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208451)