{"title":"平行压力校正算法在三维涡轮机械流动中的应用","authors":"M. Braaten","doi":"10.1109/SHPCC.1992.232657","DOIUrl":null,"url":null,"abstract":"A parallel algorithm for the solution of three-dimensional compressible flows in turbomachinery has been developed and demonstrated on a scalable distributed memory multicomputer. The algorithm solves the compressible form of the Euler or Navier-Stokes equations via a compressible pressure correction formulation. To achieve high accuracy for highly turning blade rows, the computational grid is constructed without requiring strict periodicity of the grid points along the periodic boundaries between the blade passages. The impact of this feature on code parallelization and computational efficiency is described. The algorithm has been demonstrated on up to 128 processors of an Intel iPSC/860. Performance 2.4 times faster than a single Cray Y-MP processor has been achieved for an inviscid turbomachinery calculation on 154000 grid points with 128 processors of the iPSC/860.<<ETX>>","PeriodicalId":254515,"journal":{"name":"Proceedings Scalable High Performance Computing Conference SHPCC-92.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Applications of a parallel pressure-correction algorithm to 3D turbomachinery flows\",\"authors\":\"M. Braaten\",\"doi\":\"10.1109/SHPCC.1992.232657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A parallel algorithm for the solution of three-dimensional compressible flows in turbomachinery has been developed and demonstrated on a scalable distributed memory multicomputer. The algorithm solves the compressible form of the Euler or Navier-Stokes equations via a compressible pressure correction formulation. To achieve high accuracy for highly turning blade rows, the computational grid is constructed without requiring strict periodicity of the grid points along the periodic boundaries between the blade passages. The impact of this feature on code parallelization and computational efficiency is described. The algorithm has been demonstrated on up to 128 processors of an Intel iPSC/860. Performance 2.4 times faster than a single Cray Y-MP processor has been achieved for an inviscid turbomachinery calculation on 154000 grid points with 128 processors of the iPSC/860.<<ETX>>\",\"PeriodicalId\":254515,\"journal\":{\"name\":\"Proceedings Scalable High Performance Computing Conference SHPCC-92.\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Scalable High Performance Computing Conference SHPCC-92.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SHPCC.1992.232657\",\"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 Scalable High Performance Computing Conference SHPCC-92.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SHPCC.1992.232657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Applications of a parallel pressure-correction algorithm to 3D turbomachinery flows
A parallel algorithm for the solution of three-dimensional compressible flows in turbomachinery has been developed and demonstrated on a scalable distributed memory multicomputer. The algorithm solves the compressible form of the Euler or Navier-Stokes equations via a compressible pressure correction formulation. To achieve high accuracy for highly turning blade rows, the computational grid is constructed without requiring strict periodicity of the grid points along the periodic boundaries between the blade passages. The impact of this feature on code parallelization and computational efficiency is described. The algorithm has been demonstrated on up to 128 processors of an Intel iPSC/860. Performance 2.4 times faster than a single Cray Y-MP processor has been achieved for an inviscid turbomachinery calculation on 154000 grid points with 128 processors of the iPSC/860.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
