Improved Bound for Dilation of an Embedding onto Circulant Networks
Implementation of parallel algorithms and simulation of different interconnection networks need an effective tool, that is, graph embedding. This paper focuses on improving a lower bound obtained in Rajan et al. (Comput J 58:3271–3278, 2015) for dilation of an embedding onto circulant networks. In addition, this paper provides algorithms to compute dilation of embedding circulant network into certain trees, for instance, m-rooted complete binary tree, m-rooted sibling tree, and r-dimensional hypertree, proving that the improved bound obtained is sharp.
KeywordsEmbedding Dilation Circulant network Binary tree Sibling tree Hypertree
Mathematics Subject Classification05C60 05C85
The work of R. Sundara Rajan was partially supported by Project No. ECR/2016/1993, Science and Engineering Research Board (SERB), Department of Science and Technology (DST), Government of India.
- 2.Chaudhary, V., Aggarwal, J.K.: Generalized mapping of parallel algorithms onto parallel architectures. Proc. Int’l. Conf. Parallel Process, 137–141, (1990)Google Scholar
- 7.Bermond, J.C., Comellas, F., Hsu, D.F.: Distributed loop computer networks. A survey: Journal of Parallel and Distributed Computing, 24, 2–10 (1995)Google Scholar