利用域分解技术去除互连仿真中的冗余

V. Ambalavanar, A. Jerome, P. Gunupudi
{"title":"利用域分解技术去除互连仿真中的冗余","authors":"V. Ambalavanar, A. Jerome, P. Gunupudi","doi":"10.1109/SPI.2007.4512217","DOIUrl":null,"url":null,"abstract":"A new, accurate and efficient coupled interconnect simulation algorithm is presented in this paper. This algorithm eliminates redundancies present in simulation of interconnect networks by exploiting the repetitive nature of segments in traditional interconnect discretization methods with the aid of domain decomposition methods. Since the proposed algorithm does not perform any approximations, the numerical accuracy of the original network is not compromised. This algorithm was tested on practical interconnect networks and a considerable speed-up was obtained.","PeriodicalId":206352,"journal":{"name":"2007 IEEE Workshop on Signal Propagation on Interconnects","volume":"56 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Removing redundancy in interconnect simulation using domain decomposition techniques\",\"authors\":\"V. Ambalavanar, A. Jerome, P. Gunupudi\",\"doi\":\"10.1109/SPI.2007.4512217\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A new, accurate and efficient coupled interconnect simulation algorithm is presented in this paper. This algorithm eliminates redundancies present in simulation of interconnect networks by exploiting the repetitive nature of segments in traditional interconnect discretization methods with the aid of domain decomposition methods. Since the proposed algorithm does not perform any approximations, the numerical accuracy of the original network is not compromised. This algorithm was tested on practical interconnect networks and a considerable speed-up was obtained.\",\"PeriodicalId\":206352,\"journal\":{\"name\":\"2007 IEEE Workshop on Signal Propagation on Interconnects\",\"volume\":\"56 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Workshop on Signal Propagation on Interconnects\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SPI.2007.4512217\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Workshop on Signal Propagation on Interconnects","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPI.2007.4512217","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种新的、准确、高效的耦合互连仿真算法。该算法利用传统互连离散化方法中分段的重复特性,借助域分解方法消除了互连网络仿真中存在的冗余。由于所提出的算法不执行任何近似,因此不会损害原始网络的数值精度。该算法在实际互联网络上进行了测试,取得了显著的提速效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Removing redundancy in interconnect simulation using domain decomposition techniques
A new, accurate and efficient coupled interconnect simulation algorithm is presented in this paper. This algorithm eliminates redundancies present in simulation of interconnect networks by exploiting the repetitive nature of segments in traditional interconnect discretization methods with the aid of domain decomposition methods. Since the proposed algorithm does not perform any approximations, the numerical accuracy of the original network is not compromised. This algorithm was tested on practical interconnect networks and a considerable speed-up was obtained.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信