arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.08345cs.PLcs.LO
收藏

分治策略的自动综合

Automated Synthesis of Divide and Conquer Parallelism

Azadeh Farzan, Victor Nicolet

摘要:

本文重点介绍了分治并行的自动合成,这是一个常见的并行编程框架,支持许多跨平台的多线程库。生产的挑战(手动或自动地)从给定顺序代码得到正确的分治并行程序是双重的:(1)假设各个工作线程执行与顺序代码相同的代码,则程序员必须提供用于划分任务和组合计算结果的额外代码,以及(2)有时,顺序代码可能不能按原样使用,并且可能需要由程序员修改。我们在本文中解决这两个挑战。我们提出了一种自动合成技术的情况下,不需要修改的顺序代码,我们提出了一种算法,用于修改顺序代码,使其适合并行化时,一些修改是必要的。本文提出的理论结果时,这种{ \em修改}是有效的可能性,和实验评价的技术和质量的并行程序。

英文摘要:

This paper focuses on automated synthesis of divide-and-conquer parallelism, which is a common parallel programming skeleton supported by many cross-platform multithreaded libraries. The challenges of producing (manually or automatically) a correct divide-and-conquer parallel program from a given sequential code are two-fold: (1) assuming that individual worker threads execute a code identical to the sequential code, the programmer has to provide the extra code for dividing the tasks and combining the computation results, and (2) sometimes, the sequential code may not be usable as is, and may need to be modified by the programmer. We address both challenges in this paper. We present an automated synthesis technique for the case where no modifications to the sequential code are required, and we propose an algorithm for modifying the sequential code to make it suitable for parallelization when some modification is necessary. The paper presents theoretical results for when this {\em modification} is efficiently possible, and experimental evaluation of the technique and the quality of the produced parallel programs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑