{"title":"一个并行伪谱MHD代码的优化","authors":"A. Dubey, T. Clune","doi":"10.1109/FMPC.1999.750602","DOIUrl":null,"url":null,"abstract":"In this article we outline some techniques for optimizing spectral codes using multidimensional real-to-complex FFT's. We have successfully applied these techniques on a pseudospectral MHD code running on the CRAY T3E. The code uses half precision, and runs up to 2.5 times faster than the version that uses full precision CRAY SCILIB parallel FFT routines. The half precision version without these optimizations is slower does not scale very well, and cannot support more than 128 processors. The optimized code achieved a performance of 100 Gflops on 1024 nodes of a CRAY T3E-600 at NASA Goddard Space Flight Center.","PeriodicalId":405655,"journal":{"name":"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation","volume":"45 10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimization of a parallel pseudospectral MHD code\",\"authors\":\"A. Dubey, T. Clune\",\"doi\":\"10.1109/FMPC.1999.750602\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article we outline some techniques for optimizing spectral codes using multidimensional real-to-complex FFT's. We have successfully applied these techniques on a pseudospectral MHD code running on the CRAY T3E. The code uses half precision, and runs up to 2.5 times faster than the version that uses full precision CRAY SCILIB parallel FFT routines. The half precision version without these optimizations is slower does not scale very well, and cannot support more than 128 processors. The optimized code achieved a performance of 100 Gflops on 1024 nodes of a CRAY T3E-600 at NASA Goddard Space Flight Center.\",\"PeriodicalId\":405655,\"journal\":{\"name\":\"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"45 10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-02-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1999.750602\",\"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. Frontiers '99. Seventh Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1999.750602","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在本文中,我们概述了一些使用多维实数到复数FFT优化频谱码的技术。我们已经成功地将这些技术应用于CRAY T3E上运行的伪谱MHD代码。代码使用半精度,运行速度比使用全精度CRAY SCILIB并行FFT例程的版本快2.5倍。没有这些优化的半精度版本速度较慢,伸缩性不太好,不能支持超过128个处理器。优化后的代码在美国宇航局戈达德航天飞行中心的CRAY T3E-600的1024个节点上实现了100 gflop的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimization of a parallel pseudospectral MHD code
In this article we outline some techniques for optimizing spectral codes using multidimensional real-to-complex FFT's. We have successfully applied these techniques on a pseudospectral MHD code running on the CRAY T3E. The code uses half precision, and runs up to 2.5 times faster than the version that uses full precision CRAY SCILIB parallel FFT routines. The half precision version without these optimizations is slower does not scale very well, and cannot support more than 128 processors. The optimized code achieved a performance of 100 Gflops on 1024 nodes of a CRAY T3E-600 at NASA Goddard Space Flight Center.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Token space minimization by simulated annealing Fast parallel selection on the linear array with reconfigurable pipelined bus system Packing/unpacking information generation for efficient generalized kr/spl rarr/r and r/spl rarr/kr array redistribution Latency tolerant algorithms for WAN based workstation clusters New algorithms for efficient mining of association rules
×
引用
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