电信应用电磁场的并行模拟

D. Rodohan, S. Saunders, S. Cvetkovic, P. Beavis, R. Glover
{"title":"电信应用电磁场的并行模拟","authors":"D. Rodohan, S. Saunders, S. Cvetkovic, P. Beavis, R. Glover","doi":"10.1109/ICCS.1994.474215","DOIUrl":null,"url":null,"abstract":"The finite difference time domain (FDTD) algorithm has become a popular-technique with which to solve many different electromagnetic problems. However, for real problems the mesh size becomes large and as a result the computation time on a workstation is in the region of tens of hours. In fact, in some cases there will be insufficient memory available on a workstation to solve large problems. We describe a general method based on distributed computing to reduce both the memory requirements and the computation time of the FDTD algorithm. An implementation of the FDTD algorithm on a network of workstations is then evaluated. The implementation is shown to give a peak speed up of 7.5 on a network of 8 workstations over the sequential computation time.<<ETX>>","PeriodicalId":158681,"journal":{"name":"Proceedings of ICCS '94","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Parallel simulation of electromagnetic fields for telecommunication applications\",\"authors\":\"D. Rodohan, S. Saunders, S. Cvetkovic, P. Beavis, R. Glover\",\"doi\":\"10.1109/ICCS.1994.474215\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The finite difference time domain (FDTD) algorithm has become a popular-technique with which to solve many different electromagnetic problems. However, for real problems the mesh size becomes large and as a result the computation time on a workstation is in the region of tens of hours. In fact, in some cases there will be insufficient memory available on a workstation to solve large problems. We describe a general method based on distributed computing to reduce both the memory requirements and the computation time of the FDTD algorithm. An implementation of the FDTD algorithm on a network of workstations is then evaluated. The implementation is shown to give a peak speed up of 7.5 on a network of 8 workstations over the sequential computation time.<<ETX>>\",\"PeriodicalId\":158681,\"journal\":{\"name\":\"Proceedings of ICCS '94\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-11-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ICCS '94\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.1994.474215\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICCS '94","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.1994.474215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

时域有限差分(FDTD)算法已成为解决许多电磁问题的一种流行技术。然而,对于实际问题,网格尺寸变得很大,因此工作站的计算时间在数十小时左右。事实上,在某些情况下,工作站上可用的内存不足以解决大型问题。本文提出了一种基于分布式计算的通用方法,以减少时域有限差分算法的内存需求和计算时间。然后评估了FDTD算法在工作站网络上的实现。在一个有8个工作站的网络上,在连续计算时间内,该实现的峰值速度提高了7.5。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Parallel simulation of electromagnetic fields for telecommunication applications
The finite difference time domain (FDTD) algorithm has become a popular-technique with which to solve many different electromagnetic problems. However, for real problems the mesh size becomes large and as a result the computation time on a workstation is in the region of tens of hours. In fact, in some cases there will be insufficient memory available on a workstation to solve large problems. We describe a general method based on distributed computing to reduce both the memory requirements and the computation time of the FDTD algorithm. An implementation of the FDTD algorithm on a network of workstations is then evaluated. The implementation is shown to give a peak speed up of 7.5 on a network of 8 workstations over the sequential computation time.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信