Yiran Wang, Li Chen, Xiaobing Feng, Zhaoqing Zhang
{"title":"全局部分复制计算分区","authors":"Yiran Wang, Li Chen, Xiaobing Feng, Zhaoqing Zhang","doi":"10.1109/ICPP.2004.1327910","DOIUrl":null,"url":null,"abstract":"Early parallelizing compilers use the owner-computes rule to partition computation. Partial replication is then introduced to eliminate near-neighbor communication at the cost of some replicated computation, hence improves the performance and scalability. Current exploration of partial replicate computation partitioning is limited within a single loop nest. We present a formal description of the global partial replicate computation partitioning problem, a simplified cost model and a heuristic solution. Experimental results show that the solution is superior to local approaches.","PeriodicalId":106240,"journal":{"name":"International Conference on Parallel Processing, 2004. ICPP 2004.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Global partial replicate computation partitioning\",\"authors\":\"Yiran Wang, Li Chen, Xiaobing Feng, Zhaoqing Zhang\",\"doi\":\"10.1109/ICPP.2004.1327910\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Early parallelizing compilers use the owner-computes rule to partition computation. Partial replication is then introduced to eliminate near-neighbor communication at the cost of some replicated computation, hence improves the performance and scalability. Current exploration of partial replicate computation partitioning is limited within a single loop nest. We present a formal description of the global partial replicate computation partitioning problem, a simplified cost model and a heuristic solution. Experimental results show that the solution is superior to local approaches.\",\"PeriodicalId\":106240,\"journal\":{\"name\":\"International Conference on Parallel Processing, 2004. ICPP 2004.\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Parallel Processing, 2004. ICPP 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.2004.1327910\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Parallel Processing, 2004. ICPP 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.2004.1327910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Early parallelizing compilers use the owner-computes rule to partition computation. Partial replication is then introduced to eliminate near-neighbor communication at the cost of some replicated computation, hence improves the performance and scalability. Current exploration of partial replicate computation partitioning is limited within a single loop nest. We present a formal description of the global partial replicate computation partitioning problem, a simplified cost model and a heuristic solution. Experimental results show that the solution is superior to local approaches.