XPS: FULL: Collaborative Research: PARAGRAPH: Parallel, Scalable Graph Analytics

XPS：完整：协作研究：段落：并行、可扩展图形分析

基本信息

批准号：
1629657
负责人：
John Owens
金额：
$ 32.81万
依托单位：
University of California-Davis
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2016
资助国家：
美国
起止时间：
2016-09-01 至 2021-08-31
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=1629657&HistoricalAwards=false
关键词：
XPS FULL Collaborative Research PARAGRAPH

项目摘要

Many real world problems can be effectively modeled as complex relationship networks or graphs where nodes represent entities of interest and edges mimic the interactions or relationships among them. The number of such problems and the diversity of domains from which they arise is growing. However developing high-performance applications to extract useful information from such datasets is very challenging. Graphical processing units are very attractive for such applications because they offer higher computational performance and energy efficiency than standard multi-core processors. However, the development of high-performance applications for them is currently much more challenging than parallel program development for standard multi-core processors. Effective application development to use graphical processing units generally requires that developers possess considerable expertise on their architectural characteristics and use specialized programming models and performance optimization techniques. Thus, simultaneously achieving high performance and high user productivity for data analytics applications for such devices is a daunting challenge.This project proposes a scalable high-level software framework to enable the productive development of high-performance applications for graphical processing units. It features two distinct abstractions to address the performance and productivity challenges in developing graph/data analytics applications: 1) a frontier-centric abstraction that is based on a common iterative characteristic of many of these applications, with a dynamically moving active frontier of vertices (or edges) where computation is centered, and 2) an abstraction based on sparse linear algebra primitives, exploiting the dual relationship between sparse matrices and graphs. A benchmark suite of graph analytics applications will be developed and evaluated using both abstractions, enabling insights into the effectiveness of these alternate high-level abstractions for a range of analytics applications. The benchmark suite and the software framework will be publicly released.

许多现实世界的问题可以有效地建模为复杂的关系网络或图形，其中节点代表感兴趣的实体，边模仿它们之间的交互或关系。此类问题的数量及其产生领域的多样性正在不断增加。然而，开发高性能应用程序以从此类数据集中提取有用信息非常具有挑战性。图形处理单元对于此类应用非常有吸引力，因为它们比标准多核处理器提供更高的计算性能和能源效率。然而，目前为其开发高性能应用程序比标准多核处理器的并行程序开发更具挑战性。使用图形处理单元的有效应用程序开发通常要求开发人员在其架构特征方面拥有丰富的专业知识，并使用专门的编程模型和性能优化技术。因此，同时实现此类设备的数据分析应用程序的高性能和高用户生产力是一项艰巨的挑战。该项目提出了一个可扩展的高级软件框架，以实现图形处理单元的高性能应用程序的高效开发。它具有两种不同的抽象，可以解决开发图形/数据分析应用程序时的性能和生产力挑战：1）以前沿为中心的抽象，基于许多这些应用程序的共同迭代特征，具有动态移动的顶点活动前沿（或边），其中计算为中心，2）基于稀疏线性代数原语的抽象，利用稀疏矩阵和图之间的对偶关系。将使用这两种抽象来开发和评估图形分析应用程序的基准套件，从而深入了解这些替代高级抽象对一系列分析应用程序的有效性。基准套件和软件框架将公开发布。

项目成果

期刊论文数量（18）

专著数量（0）

科研奖励数量（0）

会议论文数量（0）

专利数量（0）

Mathematical foundations of the GraphBLAS

DOI：
10.1109/hpec.2016.7761646
发表时间：
2016-06
期刊：
2016 IEEE High Performance Extreme Computing Conference (HPEC)
影响因子：
0
作者：
J. Kepner;Peter Aaltonen;David A. Bader;A. Buluç;F. Franchetti;J. Gilbert;D. Hutchison;Manoj Kumar;A. Lumsdaine;Henning Meyerhenke;Scott McMillan;Carl Yang;John Douglas Owens;Marcin Zalewski;T. Mattson;J. Moreira
通讯作者：
J. Kepner;Peter Aaltonen;David A. Bader;A. Buluç;F. Franchetti;J. Gilbert;D. Hutchison;Manoj Kumar;A. Lumsdaine;Henning Meyerhenke;Scott McMillan;Carl Yang;John Douglas Owens;Marcin Zalewski;T. Mattson;J. Moreira

Implementing Push-Pull Efficiently in GraphBLAS