On Optimal Embeddings in 3-Ary n-Cubes

Author:

Rajeshwari S.1,Rajesh M.2ORCID

Affiliation:

1. School of Advanced Sciences, Vellore Institute of Technology, Chennai 600127, India

2. School of Computer Science and Engineering, Vellore Institute of Technology, Chennai 600127, India

Abstract

The efficiency of a graph embedding problem when simulating one interconnection network in another interconnection network is characterized by the influential parameter of wirelength. Obtaining the minimum wirelength in an embedding problem determines the quality of that embedding. In this paper, we obtained the convex edge partition of 3-Ary n-Cubes and the minimized wirelength of the embeddings of both 3-Ary n-Cubes and circulant networks.

Funder

Vellore Institute of Technology, Chennai, India

Publisher

MDPI AG

Subject

General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)

Reference42 articles.

1. A survey of research and practices of network-on-chip;Bjerregaard;ACM Comput. Surv.,2006

2. Networks on chips: A new SoC paradigm;Benini;Computer,2002

3. Multicast-based testing and thermal-aware test scheduling for 3D ICs with a stacked network-on-chip;Xiang;IEEE Trans. Comput.,2015

4. Embedding of cycles and wheels into arbitrary trees;Rajasingh;Netw. Int. J.,2004

5. Guu, C.J. (1997). The Circular Wirelength Problem for Hypercubes, University of California.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3