Scheduling reductions
Scheduling reductions
复制标题
减少调度
DOI：
10.1145/181181.181319
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
P. Feautrier
中科院分区：
文献类型：
--
作者：
Xavier Redon;P. Feautrier
为了在科学程序中检测更多的并行性，可以提取相对于约简的并行性。本文提出了这样一种方法，调度程序与显式计算的减少。我们用我们的输入语言（实际上是[RF93]中提出的约简检测器的输出语言）描述了约简的表达方式。我们还简要总结了调度技术。为了简化调度，我们假设目标并行计算机有无限个处理器，具有无限扇入。我们表明，该模型计算的时间表可以适应工作在真实的并行机。然后，我们提出了一个调度方法的基础上，从[Fea92a，Fea92b]的工作存在的减少。并将该方法应用于一个实例。最后，我们表明，减少调度的副作用是简化的调度过程和改进的计算时间表。
In order to detect more parallelism in scientific programs, one may extract a parallelism relative to reductions. This paper presents such a method which schedules programs with explicit computations of reductions. We describe the way the reductions are expressed in our input language (which is in fact the output language of the reductions detector presented in [RF93]). We also give a brief summary of scheduling techniques. In order to simplify the scheduling we suppose that the target parallel computer has an infinite number of processors with infinite fan-in. We show that a schedule computed with this model can be adapted to work on real parallel machines. Then we present a scheduling method based on the algorithms from [Fea92a, Fea92b] which works in presence of reductions. This method is applied on an example. Lastly, we show that side-effects of reductions scheduling are the simplification of the scheduling process and the improvement of the computed schedules.