The Index-Permutation Graph Model for Hierarchical Interconnection Networks

Authors:
Chi-Hsiang Yeh;Behrooz Parhami
Affiliations:
-;-
Venue:
ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
Year:
1999

Citing 0
Cited 4

Routing and Embeddings in Super Cayley Graphs

PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Multilayer VLSI Layout for Interconnection Networks

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
General biswapped networks and their topological properties

APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Comparing four classes of torus-based parallel architectures: Networkparameters and communication performance

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present the index-permutation (IP) graph model, and apply it to the systematic development of efficient hierarchical networks. We derive several classes of interconnection networks based on IP graphs to achieve desired properties; the results compare favorably with popular interconnection networks, as measured by topological (e.g., node degree and diameter) and algorithmic properties, and are particularly efficient in view of their sparse inter-module communication patterns. In particular, the diameters of suitably-constructed super-IP graphs, a subclass of IP graphs, are optimal within a factor of 1 +o(1), given their node degrees. The IP graph model can also be used as a common platform that unifies the architectures and algorithms for a vast variety of interconnection networks.