{"title":"分布式共享内存机器上的循环缩减","authors":"Sebastian Allmann, T. Rauber, G. Rünger","doi":"10.1109/EMPDP.2001.905055","DOIUrl":null,"url":null,"abstract":"Cyclic reduction for the solution of linear equation systems with banded matrices exhibits fine to medium grain potential parallelism with regular but diverse data dependencies. We consider the parallel implementation for this algorithm on a distributed shared memory machine with different programming models. As distributed shared memory machine we use the Convex SPP2000. We compare the runtime results with results from a Cray T3E.","PeriodicalId":262971,"journal":{"name":"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Cyclic reduction on distributed shared memory machines\",\"authors\":\"Sebastian Allmann, T. Rauber, G. Rünger\",\"doi\":\"10.1109/EMPDP.2001.905055\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cyclic reduction for the solution of linear equation systems with banded matrices exhibits fine to medium grain potential parallelism with regular but diverse data dependencies. We consider the parallel implementation for this algorithm on a distributed shared memory machine with different programming models. As distributed shared memory machine we use the Convex SPP2000. We compare the runtime results with results from a Cray T3E.\",\"PeriodicalId\":262971,\"journal\":{\"name\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Ninth Euromicro Workshop on Parallel and Distributed Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMPDP.2001.905055\",\"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 Ninth Euromicro Workshop on Parallel and Distributed Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMPDP.2001.905055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cyclic reduction on distributed shared memory machines
Cyclic reduction for the solution of linear equation systems with banded matrices exhibits fine to medium grain potential parallelism with regular but diverse data dependencies. We consider the parallel implementation for this algorithm on a distributed shared memory machine with different programming models. As distributed shared memory machine we use the Convex SPP2000. We compare the runtime results with results from a Cray T3E.