Parallel Simulation of Massively Coupled Interconnect Networks

D. Paul, N. Nakhla, R. Achar, M. Nakhla
{"title":"Parallel Simulation of Massively Coupled Interconnect Networks","authors":"D. Paul, N. Nakhla, R. Achar, M. Nakhla","doi":"10.1109/TADVP.2009.2025263","DOIUrl":null,"url":null,"abstract":"In a system containing high-speed interconnects, the presence of a large number of coupled lines seriously limits the ability to perform fast simulations. In this paper, a parallel algorithm is presented that allows for simulations of massively coupled interconnects to be performed efficiently. New methods based on physical and time-domain partitioning are developed to create parallelism during transient simulations of large coupled interconnects. In addition, the proposed method exploits the recently developed waveform relaxation techniques to decouple and parallelize the large coupled simulation problem. In this approach, for a simulation of nL lines run on nP processors, the computational complexity is O(nLnP -1). This provides considerable savings as opposed to O(nL ß ), 3 ¿ ß ¿ 4 for full coupled-line simulations.","PeriodicalId":55015,"journal":{"name":"IEEE Transactions on Advanced Packaging","volume":"33 1","pages":"115-127"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/TADVP.2009.2025263","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Advanced Packaging","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TADVP.2009.2025263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

In a system containing high-speed interconnects, the presence of a large number of coupled lines seriously limits the ability to perform fast simulations. In this paper, a parallel algorithm is presented that allows for simulations of massively coupled interconnects to be performed efficiently. New methods based on physical and time-domain partitioning are developed to create parallelism during transient simulations of large coupled interconnects. In addition, the proposed method exploits the recently developed waveform relaxation techniques to decouple and parallelize the large coupled simulation problem. In this approach, for a simulation of nL lines run on nP processors, the computational complexity is O(nLnP -1). This provides considerable savings as opposed to O(nL ß ), 3 ¿ ß ¿ 4 for full coupled-line simulations.
大规模耦合互连网络的并行仿真
在包含高速互连的系统中,大量耦合线的存在严重限制了执行快速模拟的能力。本文提出了一种并行算法,可以有效地进行大规模耦合互连的仿真。提出了基于物理和时域划分的新方法,以在大型耦合互连的瞬态仿真中创建并行性。此外,该方法利用最新发展的波形松弛技术对大型耦合仿真问题进行解耦和并行化。在这种方法中,对于在nP处理器上运行的nL行模拟,计算复杂度为0 (nLnP -1)。与全耦合线模拟的0 (nL ß), 3¿ß¿4相比,这提供了相当大的节省。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Advanced Packaging
IEEE Transactions on Advanced Packaging 工程技术-材料科学:综合
自引率
0.00%
发文量
0
审稿时长
6 months
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信