面向并行执行的计算DAG数据移动复杂性的表征
On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution
摘要:
技术趋势使得数据移动的成本在能量和时间方面都日益超过在计算机系统中执行算术运算的成本。在并行计算机系统中,聚合数据移动带宽与总计算能力(也称为机器平衡参数)的基本比率正在减小。它是有-forth相当重要的特征的并行算法的固有的数据移动的要求,以便所需的最小架构的平衡参数,以支持它在未来的系统可以很好地理解。在本文中,我们开发了一个著名的红蓝卵石游戏的扩展开发的数据移动的复杂性的下限并行执行的计算有向无环图(CDAGs)的并行系统。我们模拟多节点多核并行系统,总的物理内存分布在节点(通过一些互连网络连接)和一个多层次的共享缓存层次结构的处理器在一个节点内。我们还开发了新的技术,用于非均质CDAGs的下限表征。我们展示了使用的方法,通过分析几个数值算法的CDAGs,开发其并行执行的数据移动的下限。
英文摘要:
Technology trends are making the cost of data movement increasingly dominant, both in terms of energy and time, over the cost of performing arithmetic operations in computer systems. The fundamental ratio of aggregate data movement bandwidth to the total computational power (also referred to the machine balance parameter) in parallel computer systems is decreasing. It is there- fore of considerable importance to characterize the inherent data movement requirements of parallel algorithms, so that the minimal architectural balance parameters required to support it on future systems can be well understood. In this paper, we develop an extension of the well-known red-blue pebble game to develop lower bounds on the data movement complexity for the parallel execution of computational directed acyclic graphs (CDAGs) on parallel systems. We model multi-node multi-core parallel systems, with the total physical memory distributed across the nodes (that are connected through some interconnection network) and in a multi-level shared cache hierarchy for processors within a node. We also develop new techniques for lower bound characterization of non-homogeneous CDAGs. We demonstrate the use of the methodology by analyzing the CDAGs of several numerical algorithms, to develop lower bounds on data movement for their parallel execution.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。