On the Automatic Parallelization of the Perfect Benchmarks
On the Automatic Parallelization of the Perfect Benchmarks
复制标题
论完美基准的自动并行化
DOI：
--
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
D. Padua
中科院分区：
文献类型：
--
作者：
R. Eigenmann;J. Hoeflinger;D. Padua
本文介绍了1989年至1992年在伊利诺伊大学超级计算研究与开发中心(CSRD)内进行的雪松人工并行化实验的结果。在这个实验中，我们手动将完美的基准测试(R)转换为并行程序版本。在这样做的过程中，我们使用了可以在优化编译器中自动执行的技术。然后，我们在Cedar多处理器(20世纪80年代在CSRD构建)上运行这些程序，并测量每种技术带来的速度改进。这里给出的结果扩展了先前报道的结果。最能带来性能提升的技术包括数组私有化、归约操作的并行化和广义归纳变量的替换。所有这些技术都可以被认为是20世纪80年代末向量化器和商业重组编译器中可用的转换的扩展。我们以一种类似于并行化编译器的机械方式，将这些转换手动应用于给定的程序。由于我们在这些转换方面取得了成功，我们相信有可能在新的并行化编译器中实现其中的许多技术。这样的编译器已经完成，我们给出了初步的结果。
This paper presents the results of the Cedar Hand-Parallelization Experiment conducted from 1989 through 1992, within the Center for Supercomputing Research and Development (CSRD) at the University of Illinois. In this experiment, we manually transformed the Perfect Benchmarks(R) into parallel program versions. In doing so, we used techniques that may be automated in an optimizing compiler. We then ran these programs on the Cedar multiprocessor (built at CSRD during the 1980s) and measured the speed improvement due to each technique. The results presented here extend the findings previously reported. The techniques credited most for the performance gains include array privatization, parallelization of reduction operations, and the substitution of generalized induction variables. All these techniques can be considered extensions of transformations that were available in vectorizers and commercial restructuring compilers of the late 1980s. We applied these transformations by hand to the given programs, in a mechanical manner, similar to that of a parallelizing compiler. Because of our success with these transformations, we believed that it would be possible to implement many of these techniques in a new parallelizing compiler. Such a compiler has been completed in the meantime and we show preliminary results.