Embedding Circulant Networks into Butterfly and Benes Networks
The dilation of an embedding is defined as the maximum distance between pairs of vertices of host graph that are images of adjacent vertices of guest graph. An embedding with a long dilation faces many problems, such as long communication delay, coupling problems and the existence of different types of uncontrolled noise. In this paper, we compute the minimum dilation of embedding circulant networks into butterfly and benes networks.
KeywordsEmbedding Dilation Circulant network Butterfly and benes networks
The authors would like to thank the anonymous referees for their comments and suggestions. These comments and suggestions were very helpful for improving the quality of this paper.
- 1.Chaudhary, V., Aggarwal, J.K.: Generalized mapping of parallel algorithms onto parallel architectures. In: Proceeding of International Conference on Parallel Processing, pp. 137–141 (1990)Google Scholar
- 3.Bezrukov, S.L., Chavez, J.D., Harper, L.H., Röttger, M., Schroeder, U.P.: Embedding of hypercubes into grids. In: Mortar Fire Control System, pp.693–701 (1998)Google Scholar
- 7.Manuel, P., Rajasingh, I., Rajan, R.S.: Embedding variants of hypercubes with dilation 2. J. Interconnect. Netw. 13(1–2), 1–16 (2012)Google Scholar
- 18.Rajan, R.S., Miller, M., Rajasingh, I., Manuel, P.: Embedding circulant networks into certain trees. J. Comb. Optim. (submitted)Google Scholar
- 19.Rajan, R.S., Manuel, P., Rajasingh, I., Parthiban, N., Miller, M.: A lower bound for dilation of an embedding. Comput. J. (2015). http://comjnl.oxfordjournals.org/content/early/2015/04/01/comjnl.bxv021