arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1201.3778cs.PLcs.DS
收藏

不规则程序乐观优化的处理机分配

Processor Allocation for Optimistic Parallelization of Irregular Programs

Francesco Versaci, Keshav Pingali

摘要:

乐观并行化是一种很有前途的不规则算法的并行化方法:潜在的干扰任务动态启动,运行时系统检测并发活动之间的冲突,中止和回滚冲突的任务。然而,非规则算法的并行性非常复杂。在像稠密矩阵乘法这样的常规算法中,并行性的数量通常可以表示为问题大小的函数,因此确定应该分配多少处理器来执行特定大小的常规算法是相当简单的(这被称为处理器分配问题)。相比之下,非常规算法中的并行性可以是输入参数的函数,并且并行性的量可以在非常规算法的执行期间显著地变化。因此,非规则算法的处理器分配问题是非常困难的。在本文中,我们描述了解决这个问题的第一个系统的战略。我们的方法是基于一个结构称为冲突图,它(i)提供了洞察的并行度,可以从一个不规则的算法中提取,(ii)可以用来解决不规则算法的处理器分配问题。我们发现,这个问题是有关的概括不友好的座位问题,并通过扩展图兰定理,我们得到了最坏情况下的一类问题的乐观并行化,我们用它来推导出一个下限的可利用的并行。最后,利用一些理论推导的性质和一些实验事实,我们设计了一个快速和稳定的控制策略来解决处理器分配问题的启发式。

英文摘要:

Optimistic parallelization is a promising approach for the parallelization of irregular algorithms: potentially interfering tasks are launched dynamically, and the runtime system detects conflicts between concurrent activities, aborting and rolling back conflicting tasks. However, parallelism in irregular algorithms is very complex. In a regular algorithm like dense matrix multiplication, the amount of parallelism can usually be expressed as a function of the problem size, so it is reasonably straightforward to determine how many processors should be allocated to execute a regular algorithm of a certain size (this is called the processor allocation problem). In contrast, parallelism in irregular algorithms can be a function of input parameters, and the amount of parallelism can vary dramatically during the execution of the irregular algorithm. Therefore, the processor allocation problem for irregular algorithms is very difficult. In this paper, we describe the first systematic strategy for addressing this problem. Our approach is based on a construct called the conflict graph, which (i) provides insight into the amount of parallelism that can be extracted from an irregular algorithm, and (ii) can be used to address the processor allocation problem for irregular algorithms. We show that this problem is related to a generalization of the unfriendly seating problem and, by extending Turán's theorem, we obtain a worst-case class of problems for optimistic parallelization, which we use to derive a lower bound on the exploitable parallelism. Finally, using some theoretically derived properties and some experimental facts, we design a quick and stable control strategy for solving the processor allocation problem heuristically.

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

↑