Abstract

PDF HTML阅读 XML下载 导出引用 引用提醒 基于嵌套循环分类的并行识别技术 DOI: 10.3724/SP.J.1001.2012.04178 作者: 作者单位: 作者简介: 通讯作者: 中图分类号: 基金项目: “核高基”国家科技重大专项(2009ZX01036-001-001-2) Parallelism Recognition Technology Based on Nested Loops Classifying Author: Affiliation: Fund Project: 摘要 | 图/表 | 访问统计 | 参考文献 | 相似文献 | 引证文献 | 资源附件 | 文章评论 摘要:传统的分布存储并行编译系统大多是在共享存储并行编译系统的基础上开发的.共享存储并行编译系统的并行识别技术适合 OpenMP 代码生成,实现方式是将所有嵌套循环都按照相同的识别方法进行处理,用于分布存储并行编译系统必然会导致无法高效发掘程序的并行性.分布存储并行编译系统应根据嵌套循环结构的特点进行分类处理,提出适合 MPI 代码生成的并行识别技术.为解决上述问题,根据嵌套循环的结构和 MPI 并行程序的特点,提出了一种新的嵌套循环分类方法,并针对不同的嵌套循环分别提出了相应的并行识别技术.实验结果表明,与采用传统并行识别技术的分布存储并行编译系统相比,按照所提方法对嵌套循环进行分类,采用相应并行识别技术的编译系统能够更高效地识别基准程序中的并行循环,自动生成的 MPI 并行代码其性能加速比提高了 20%以上. Abstract:Existing distributed memory parallelizing compiler systems are mostly developed based on sharedsystems. The parallelism recognition technologies of shared memory parallelizing compiler systems are suitable forOpenMP code generation. Their implementation is used to recognize all nested loops by the same technology, sothat the parallelism cannot be efficiently explored when applying them to distributed memory parallelizing compilersystems. Thus, this paper proposes some parallelism recognition technologies suitable for the MPI code generationfor distributed memory parallelizing compiler systems by classifying the nested loops according to their structures.To solve these problems, a new classification method of nested loops is proposed, according to the structure ofnested loops and characteristics of MPI parallel program. Corresponding parallelism recognition technologies fordifferent nested loops are also presented, respectively. The experimental results show that compared with thedistributed memory parallelizing compiler systems that used existing parallelism recognition technologies, thecompiler systems, which use the proposed classification method and the corresponding recognition technologies,can more efficiently recognize parallel nested loops in the benchmark programs, and the performance speedup of theMPI codes automatically increased to more than 20%. 参考文献 相似文献 引证文献

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.