在NCUBE超立方体上实现Beam和Warming隐式因子方案的性能分析

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation Pub Date : 1990-10-08 DOI:10.1109/FMPC.1990.89447

P. J. Kominsky

{"title":"在NCUBE超立方体上实现Beam和Warming隐式因子方案的性能分析","authors":"P. J. Kominsky","doi":"10.1109/FMPC.1990.89447","DOIUrl":null,"url":null,"abstract":"A production 3-D Beam and Warming implicit Navier Stokes code has been implemented on the NCUBE hypercube using the grid allocation scheme of J. Bruno and P.R. Capello (see Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications, p.1073-87, 1988). Predicted (32-b) performance on 1024 nodes is 67.1 MFLOPS. Efficiencies of 70% are attainable for implicit algorithms, although constant-memory scaled performance is found to decrease with increasing number of nodes, unlike the case for explicit implementations.<<ETX>>","PeriodicalId":193332,"journal":{"name":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Performance analysis of an implementation of the Beam and Warming implicit factored scheme on the NCUBE hypercube\",\"authors\":\"P. J. Kominsky\",\"doi\":\"10.1109/FMPC.1990.89447\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A production 3-D Beam and Warming implicit Navier Stokes code has been implemented on the NCUBE hypercube using the grid allocation scheme of J. Bruno and P.R. Capello (see Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications, p.1073-87, 1988). Predicted (32-b) performance on 1024 nodes is 67.1 MFLOPS. Efficiencies of 70% are attainable for implicit algorithms, although constant-memory scaled performance is found to decrease with increasing number of nodes, unlike the case for explicit implementations.<<ETX>>\",\"PeriodicalId\":193332,\"journal\":{\"name\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FMPC.1990.89447\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FMPC.1990.89447","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

使用J. Bruno和P.R. Capello的网格分配方案(参见Proc. 3rd Conf. on hypercube Concurrent Computers and Applications, p.1073-87, 1988)，在NCUBE超立方体上实现了生产3-D Beam和Warming隐式Navier Stokes代码。在1024个节点上预测(32-b)性能为67.1 MFLOPS。隐式算法的效率可以达到70%，尽管发现恒定内存缩放性能随着节点数量的增加而降低，这与显式实现的情况不同。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Performance analysis of an implementation of the Beam and Warming implicit factored scheme on the NCUBE hypercube

A production 3-D Beam and Warming implicit Navier Stokes code has been implemented on the NCUBE hypercube using the grid allocation scheme of J. Bruno and P.R. Capello (see Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications, p.1073-87, 1988). Predicted (32-b) performance on 1024 nodes is 67.1 MFLOPS. Efficiencies of 70% are attainable for implicit algorithms, although constant-memory scaled performance is found to decrease with increasing number of nodes, unlike the case for explicit implementations.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1990 Proceedings] The Third Symposium on the Frontiers of Massively Parallel Computation

自引率

0.00%

发文量