arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.06086cs.DC
收藏

DCAFE:递归任务并行程序的动态负载平衡循环分块和主动完成消除

DCAFE: Dynamic load-balanced loop Chunking & Aggressive Finish Elimination for Recursive Task Parallel Programs

Suyash Gupta, Rahul Shrivastava, V. Krishna Nandivada

摘要:

在本文中,我们提出了两个共生优化优化递归任务并行(RTP)程序,减少任务创建和终止的开销。我们的第一个优化积极主动消除(AFE)有助于在很大程度上减少冗余连接操作。第二个优化动态负载平衡循环分块(DLBC)扩展了先前的循环分块工作,以在运行时根据可用工作线程的数量决定并行任务的数量。此外,我们讨论了异常对我们的优化的影响,并将其扩展到处理可能抛出异常的RTP程序。我们在X10v2.3编译器中实现了DCAFE(= DLBC+AFE),并在两种不同硬件(16核Intel系统和64核AMD系统)上的一组基准内核上对其进行了测试。针对Nandivada等人[Nandivada et al.(2013)Nandivada,Shirako,Zhao,and Sarkar](LC),DCAFE在Intel和AMD系统上分别实现了5.75倍和4.16倍的几何平均速度提升。我们还对英特尔系统的能耗进行了评估,结果表明,与LC版本相比,DCAFE版本的能耗平均降低了71.2%。

英文摘要:

In this paper, we present two symbiotic optimizations to optimize recursive task parallel (RTP) programs by reducing the task creation and termination overheads. Our first optimization Aggressive Finish-Elimination (AFE) helps reduce the redundant join operations to a large extent. The second optimization Dynamic Load-Balanced loop Chunking (DLBC) extends the prior work on loop chunking to decide on the number of parallel tasks based on the number of available worker threads, at runtime. Further, we discuss the impact of exceptions on our optimizations and extend them to handle RTP programs that may throw exceptions. We implemented DCAFE (= DLBC+AFE) in the X10v2.3 compiler and tested it over a set of benchmark kernels on two different hardwares (a 16-core Intel system and a 64-core AMD system). With respect to the base X10 compiler extended with loop-chunking of Nandivada et al [Nandivada et al.(2013)Nandivada, Shirako, Zhao, and Sarkar](LC), DCAFE achieved a geometric mean speed up of 5.75x and 4.16x on the Intel and AMD system, respectively. We also present an evaluation with respect to the energy consumption on the Intel system and show that on average, compared to the LC versions, the DCAFE versions consume 71.2% less energy.

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

↑