{"title":"Oil Reservoir Simulations on Hypercubes","authors":"Jianping Zhu","doi":"10.1109/DMCC.1991.633305","DOIUrl":null,"url":null,"abstract":"A parallel numericail algorithm and its inaplementation on intel hypercubes are presented in this paper. Numerical computations show that the algorithm presented here can be used to handle reservoir models with hundreds of thousand gr id points. The block SOR algorithm with red-black ordering is used to solve the matrix equations in parallel and the binary reflection gray code algorithm is used to embed a ring structure into a hypercube to secure that the internode communication always occurs between the nearest neighbors. The efficiency of the algorithm can be well over 90 percent for the right problem site and number of nodes.","PeriodicalId":313314,"journal":{"name":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Sixth Distributed Memory Computing Conference, 1991. Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DMCC.1991.633305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A parallel numericail algorithm and its inaplementation on intel hypercubes are presented in this paper. Numerical computations show that the algorithm presented here can be used to handle reservoir models with hundreds of thousand gr id points. The block SOR algorithm with red-black ordering is used to solve the matrix equations in parallel and the binary reflection gray code algorithm is used to embed a ring structure into a hypercube to secure that the internode communication always occurs between the nearest neighbors. The efficiency of the algorithm can be well over 90 percent for the right problem site and number of nodes.