{"title":"“SEQ OF PAR”风格的结构化并行编程","authors":"Weigang Yuan, Yongqiang Sun","doi":"10.1109/APDC.1997.574017","DOIUrl":null,"url":null,"abstract":"This paper presents a new structured parallel programming model, \"SEQ OF PAR\", based on the Communication Closed Layer (CCL) principle of causal composition for parallel programs and Bird-Meertens formalism (BMF) of locality-based parallel computation. This model is to support for more general, architecture-independent parallel programming. It provides a structured approach to integrate task (or process) parallelism and data-parallelism in one framework. The well-founded algebra of CCL and BMF makes it also possible to derive, optimize and verify parallel programs through algebraic transformations. Experimental results show that it is very promising to adopt this programming model for getting efficient, portable parallel code.","PeriodicalId":413925,"journal":{"name":"Proceedings. Advances in Parallel and Distributed Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"\\\"SEQ OF PAR\\\" style structured parallel programming\",\"authors\":\"Weigang Yuan, Yongqiang Sun\",\"doi\":\"10.1109/APDC.1997.574017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new structured parallel programming model, \\\"SEQ OF PAR\\\", based on the Communication Closed Layer (CCL) principle of causal composition for parallel programs and Bird-Meertens formalism (BMF) of locality-based parallel computation. This model is to support for more general, architecture-independent parallel programming. It provides a structured approach to integrate task (or process) parallelism and data-parallelism in one framework. The well-founded algebra of CCL and BMF makes it also possible to derive, optimize and verify parallel programs through algebraic transformations. Experimental results show that it is very promising to adopt this programming model for getting efficient, portable parallel code.\",\"PeriodicalId\":413925,\"journal\":{\"name\":\"Proceedings. Advances in Parallel and Distributed Computing\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. Advances in Parallel and Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APDC.1997.574017\",\"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. Advances in Parallel and Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APDC.1997.574017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
摘要
基于并行程序的通信封闭层(CCL)因果组合原理和基于位置的并行计算的Bird-Meertens形式化(BMF),提出了一种新的结构化并行规划模型“SEQ OF PAR”。该模型支持更通用的、与体系结构无关的并行编程。它提供了一种结构化的方法,将任务(或流程)并行性和数据并行性集成到一个框架中。CCL和BMF的良好代数基础使得通过代数变换推导、优化和验证并行程序成为可能。实验结果表明,采用该编程模型可以获得高效、可移植的并行代码。
"SEQ OF PAR" style structured parallel programming
This paper presents a new structured parallel programming model, "SEQ OF PAR", based on the Communication Closed Layer (CCL) principle of causal composition for parallel programs and Bird-Meertens formalism (BMF) of locality-based parallel computation. This model is to support for more general, architecture-independent parallel programming. It provides a structured approach to integrate task (or process) parallelism and data-parallelism in one framework. The well-founded algebra of CCL and BMF makes it also possible to derive, optimize and verify parallel programs through algebraic transformations. Experimental results show that it is very promising to adopt this programming model for getting efficient, portable parallel code.