arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1505.04417cs.DCcs.CE
收藏

一种面向特定领域的高性能异构计算方法

A Domain Specific Approach to High Performance Heterogeneous Computing

Gordon Inggs, David B. Thomas, Wayne Luk

摘要:

异构计算系统的用户面临两个问题:首先,在理解他们的应用程序的可观察的特性,如延迟和结果的质量之间的权衡关系,其次,如何利用这些特性的知识,有效地分配工作到分布式计算平台。特定领域的方法可以解决这两个问题。通过考虑操作或功能的子集,可观察特性或域度量的模型可以被提前制定,并且在任务实例的运行时被填充。然后,这些度量模型可以用于将工作分配表示为受约束的整数规划,该规划可以使用逻辑学、机器学习或混合线性规划(MILP)框架来求解。这些索赔说明使用计算金融衍生品定价的示例域,与工作负载延迟或完工时间和定价准确性的域指标。对于128个基于Black-Scholes和Heston模型的期权定价任务的大而不同的工作负载,在16个多核CPU、GPU和FPGA平台的不同阵列上运行,模型对完工时间和准确性的预测通常在运行时性能的10%以内。当这些模型被用作机器学习和基于MILP的工作负载分配方法的输入时,可以看到比启发式方法的延迟改善高达24和270倍。

英文摘要:

Users of heterogeneous computing systems face two problems: firstly, in understanding the trade-off relationships between the observable characteristics of their applications, such as latency and quality of the result, and secondly, how to exploit knowledge of these characteristics to allocate work to distributed computing platforms efficiently. A domain specific approach addresses both of these problems. By considering a subset of operations or functions, models of the observable characteristics or domain metrics may be formulated in advance, and populated at run-time for task instances. These metric models can then be used to express the allocation of work as a constrained integer program, which can be solved using heuristics, machine learning or Mixed Integer Linear Programming (MILP) frameworks. These claims are illustrated using the example domain of derivatives pricing in computational finance, with the domain metrics of workload latency or makespan and pricing accuracy. For a large, varied workload of 128 Black-Scholes and Heston model-based option pricing tasks, running upon a diverse array of 16 Multicore CPUs, GPUs and FPGAs platforms, predictions made by models of both the makespan and accuracy are generally within 10% of the run-time performance. When these models are used as inputs to machine learning and MILP-based workload allocation approaches, a latency improvement of up to 24 and 270 times over the heuristic approach is seen.

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

↑