TY - GEN
T1 - Embedding grids, hypercubes, and trees in arrangement graphs
AU - Day, Khaled
AU - Tripathi, Anand
N1 - Publisher Copyright:
© 1993 IEEE.
PY - 1993
Y1 - 1993
N2 - The use of a new topology, called the arrangement graph, as a viable interconnection scheme for parallel and distributed systems, has been recently proposed and examined. The arrangement graphs represent a rich class of generalized star graphs with many attractive properties, In this paper we obtain (1) unit expansion embeddings of a variety of multi-dimensional grids, (2) dilation 1, 2, 3, and 4 embeddings of hypercubes and (3) hierarchical and greedy spanning trees to support broadcasting and personalized communication in arrangement graphs.
AB - The use of a new topology, called the arrangement graph, as a viable interconnection scheme for parallel and distributed systems, has been recently proposed and examined. The arrangement graphs represent a rich class of generalized star graphs with many attractive properties, In this paper we obtain (1) unit expansion embeddings of a variety of multi-dimensional grids, (2) dilation 1, 2, 3, and 4 embeddings of hypercubes and (3) hierarchical and greedy spanning trees to support broadcasting and personalized communication in arrangement graphs.
UR - http://www.scopus.com/inward/record.url?scp=85031555718&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85031555718&partnerID=8YFLogxK
U2 - 10.1109/ICPP.1993.76
DO - 10.1109/ICPP.1993.76
M3 - Conference contribution
AN - SCOPUS:85031555718
T3 - Proceedings of the International Conference on Parallel Processing
SP - 65
EP - 72
BT - Algorithms and Applications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1993 International Conference on Parallel Processing, ICPP 1993
Y2 - 16 August 1993 through 20 August 1993
ER -