Communication algorithms on alternating group graphs

Authors:
Chih-Ming Lai;Jyh-Jong Tsay
Affiliations:
-;-
Venue:
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Year:
1997

Citing 4
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Optimal communication algorithms for hypercubes

Journal of Parallel and Distributed Computing
Analysis of interconnection networks based on Cayley graphs related to permutation groups

Analysis of interconnection networks based on Cayley graphs related to permutation groups
Optimal Broadcasting on the Star Graph

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the problem of performing all-to-all broadcast on an n-alternating group graph AG/sub n/ with all-port and store-and-forward routing. The running time is [(n/sup 1/-2)/(4(n-2))+1] that is one step more than the trivial lower bound [(n/sup 2/-2)/(4(n-2))]. Our algorithm is based on some new properties of Hamiltonian paths of AG/sub n/ that are identified in this paper and are of independent interest. Similar properties have been used to design an algorithm for single-node scattering that achieves the same time bound.