Minimum Congestion and Wirelength of Embedding the nth Cartesian Product of K4 into Various Kinds of Grid Networks

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS JOURNAL OF INTERCONNECTION NETWORKS Pub Date : 2024-05-10 DOI:10.1142/s0219265924500099
Pingping Li, Mingzu Zhang, Litao Guo
{"title":"Minimum Congestion and Wirelength of Embedding the nth Cartesian Product of K4 into Various Kinds of Grid Networks","authors":"Pingping Li, Mingzu Zhang, Litao Guo","doi":"10.1142/s0219265924500099","DOIUrl":null,"url":null,"abstract":"Embedding an interconnection network into another network is one of the main problems in parallel processing and computing systems. Interconnection networks in multiprocessing systems facilitate effective communication among various system components. Obtaining the minimum cutwidth, congestion, and wirelength in graph embedding problems is of great significance for network design and architecture, where the minimum is taken over all embedding of guest graphs into host graphs, and addressing these issues can reduce time and cost in embedded design. This work aims to accurately calculate the minimum congestion and wirelength for the [Formula: see text] (the [Formula: see text]th Cartesian product of [Formula: see text]) layout into [Formula: see text]-dimensional, [Formula: see text]-dimensional, and [Formula: see text]-dimensional grids by the optimal solution of edge isoperimetric problem on [Formula: see text].","PeriodicalId":53990,"journal":{"name":"JOURNAL OF INTERCONNECTION NETWORKS","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"JOURNAL OF INTERCONNECTION NETWORKS","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0219265924500099","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

Embedding an interconnection network into another network is one of the main problems in parallel processing and computing systems. Interconnection networks in multiprocessing systems facilitate effective communication among various system components. Obtaining the minimum cutwidth, congestion, and wirelength in graph embedding problems is of great significance for network design and architecture, where the minimum is taken over all embedding of guest graphs into host graphs, and addressing these issues can reduce time and cost in embedded design. This work aims to accurately calculate the minimum congestion and wirelength for the [Formula: see text] (the [Formula: see text]th Cartesian product of [Formula: see text]) layout into [Formula: see text]-dimensional, [Formula: see text]-dimensional, and [Formula: see text]-dimensional grids by the optimal solution of edge isoperimetric problem on [Formula: see text].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
将 K4 的 n 次直角坐标积嵌入各类网格网络的最小拥塞和线长
将互连网络嵌入另一个网络是并行处理和计算系统中的主要问题之一。多处理系统中的互连网络有助于各系统组件之间的有效通信。获取图嵌入问题中的最小切宽、拥塞和线长对网络设计和架构意义重大,其中最小切宽是将所有客图嵌入到主图中的最小值,解决这些问题可以减少嵌入式设计的时间和成本。这项工作旨在通过[公式:见正文]上边等周长问题的最优解,精确计算[公式:见正文]([公式:见正文]的[公式:见正文]th 笛卡儿积)布局到[公式:见正文]维、[公式:见正文]维和[公式:见正文]维网格的最小拥塞和线长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
JOURNAL OF INTERCONNECTION NETWORKS
JOURNAL OF INTERCONNECTION NETWORKS COMPUTER SCIENCE, THEORY & METHODS-
自引率
14.30%
发文量
121
期刊介绍: The Journal of Interconnection Networks (JOIN) is an international scientific journal dedicated to advancing the state-of-the-art of interconnection networks. The journal addresses all aspects of interconnection networks including their theory, analysis, design, implementation and application, and corresponding issues of communication, computing and function arising from (or applied to) a variety of multifaceted networks. Interconnection problems occur at different levels in the hardware and software design of communicating entities in integrated circuits, multiprocessors, multicomputers, and communication networks as diverse as telephone systems, cable network systems, computer networks, mobile communication networks, satellite network systems, the Internet and biological systems.
期刊最新文献
On Sombor Index of Unicyclic and Bicyclic Graphs Monitoring Edge-Geodetic Numbers of Mycielskian Graph Classes Minimum Congestion and Wirelength of Embedding the nth Cartesian Product of K4 into Various Kinds of Grid Networks The Graft Transformation and Their Application on the Spectral Radius of Block Graphs Graph Bipartization and Via Minimization for Intersection Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1