{"title":"稀疏迭代线性求解的低熵数据映射","authors":"M. Esmaily-Moghadam, Y. Bazilevs, A. Marsden","doi":"10.1145/2484762.2484797","DOIUrl":null,"url":null,"abstract":"An efficient parallel data structure implementation is presented to modify the permutation on the residual vector to achieve optimized memory layout of partitioned meshes for solving sparse linear systems. This novel algorithm is proposed to sort the data on each processor with respect to a set of rules. This simplifies implementation of parallel iterative solver algorithms and allows an overlap between non-blocking MPI communication and computations in matrix-vector product operations.","PeriodicalId":426819,"journal":{"name":"Proceedings of the Conference on Extreme Science and Engineering Discovery Environment: Gateway to Discovery","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Low entropy data mapping for sparse iterative linear solvers\",\"authors\":\"M. Esmaily-Moghadam, Y. Bazilevs, A. Marsden\",\"doi\":\"10.1145/2484762.2484797\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"An efficient parallel data structure implementation is presented to modify the permutation on the residual vector to achieve optimized memory layout of partitioned meshes for solving sparse linear systems. This novel algorithm is proposed to sort the data on each processor with respect to a set of rules. This simplifies implementation of parallel iterative solver algorithms and allows an overlap between non-blocking MPI communication and computations in matrix-vector product operations.\",\"PeriodicalId\":426819,\"journal\":{\"name\":\"Proceedings of the Conference on Extreme Science and Engineering Discovery Environment: Gateway to Discovery\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Conference on Extreme Science and Engineering Discovery Environment: Gateway to Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2484762.2484797\",\"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 the Conference on Extreme Science and Engineering Discovery Environment: Gateway to Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2484762.2484797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low entropy data mapping for sparse iterative linear solvers
An efficient parallel data structure implementation is presented to modify the permutation on the residual vector to achieve optimized memory layout of partitioned meshes for solving sparse linear systems. This novel algorithm is proposed to sort the data on each processor with respect to a set of rules. This simplifies implementation of parallel iterative solver algorithms and allows an overlap between non-blocking MPI communication and computations in matrix-vector product operations.