发布求助
文献互助 智能选刊 最新文献

Proceedings of the ACM Workshop on High Performance Graph Processing最新文献

筛选
英文 中文
Parallel Shortest-Path Queries in Planar Graphs 平面图中的并行最短路径查询
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/2915516.2915518
L. Aleksandrov, Guillaume Chapuis, H. Djidjev
{"title":"Parallel Shortest-Path Queries in Planar Graphs","authors":"L. Aleksandrov, Guillaume Chapuis, H. Djidjev","doi":"10.1145/2915516.2915518","DOIUrl":"https://doi.org/10.1145/2915516.2915518","url":null,"abstract":"We develop several parallel algorithms for shortest distance queries in planar graphs that use graph partitioning in the preprocessing phase to precompute and store distances between selected pairs of vertices. In the query phase, given a pair of arbitrary vertices v and w, the stored information is used to find the distance between v and w fast. The algorithms are implemented and tested on a high performance cluster with upto 256 16-core CPUs and their performances are analyzed and compared.","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"346 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75463900","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Comparative Study on Exact Triangle Counting Algorithms on the GPU 基于GPU的精确三角形计数算法的比较研究
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/2915516.2915521
Leyuan Wang, Yangzihao Wang, Carl Yang, John Douglas Owens
{"title":"A Comparative Study on Exact Triangle Counting Algorithms on the GPU","authors":"Leyuan Wang, Yangzihao Wang, Carl Yang, John Douglas Owens","doi":"10.1145/2915516.2915521","DOIUrl":"https://doi.org/10.1145/2915516.2915521","url":null,"abstract":"We implement exact triangle counting in graphs on the GPU using three different methodologies: subgraph matching to a triangle pattern; programmable graph analytics, with a set-intersection approach; and a matrix formulation based on sparse matrix-matrix multiplies. All three deliver best-of-class performance over CPU implementations and over comparable GPU implementations, with the graph-analytic approach achieving the best performance due to its ability to exploit efficient filtering steps to remove unnecessary work and its high-performance set-intersection core.","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"21 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84942446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 48
Session details: Full Papers Session 2 会议详情:全文会议2
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/3260995
T. Suzumura
{"title":"Session details: Full Papers Session 2","authors":"T. Suzumura","doi":"10.1145/3260995","DOIUrl":"https://doi.org/10.1145/3260995","url":null,"abstract":"","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"78 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86706778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph Topology Abstraction for Distributed Path Queries 分布式路径查询的图拓扑抽象
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/2915516.2915520
Janani Balaji, Rajshekhar Sunderraman
{"title":"Graph Topology Abstraction for Distributed Path Queries","authors":"Janani Balaji, Rajshekhar Sunderraman","doi":"10.1145/2915516.2915520","DOIUrl":"https://doi.org/10.1145/2915516.2915520","url":null,"abstract":"Querying graph data often involves identifying matching paths, either as an end product, or as an intermediate step for further graph analysis. Distributed graph querying, suffers from high communication to computation costs, due to challenges in constructing comprehensive structural indexes. This could result in severe performance degradation in terms of turnaround time, which often worsens with increasing graph size and density. In this paper, we propose a novel topology abstraction layer, that helps improve query response time by reducing the communication overhead for selective exploration of large distributed graphs. We demonstrate the effectiveness of our model and also go on to show that our abstraction layer works well in both data-parallel and graph-parallel paradigms.","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88525435","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Session details: Keynote Address 会议详情:主题演讲
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/3260994
T. Suzumura
{"title":"Session details: Keynote Address","authors":"T. Suzumura","doi":"10.1145/3260994","DOIUrl":"https://doi.org/10.1145/3260994","url":null,"abstract":"","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73064434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Betweenness Centrality in an HSA-enabled System 启用hsa的系统中的中间性
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/2915516.2915526
Shuai Che, Marc S. Orr, Gregory P. Rodgers, J. Gallmeier
{"title":"Betweenness Centrality in an HSA-enabled System","authors":"Shuai Che, Marc S. Orr, Gregory P. Rodgers, J. Gallmeier","doi":"10.1145/2915516.2915526","DOIUrl":"https://doi.org/10.1145/2915516.2915526","url":null,"abstract":"This paper studies different approaches to implementing betweenness centrality in a heterogeneous system. Betweenness centrality is an important algorithm in graph processing. It presents multiple levels of parallelism when processing a graph, and is an interesting problem to exploit various optimizations. We implement different versions of betweenness centrality on an AMD accelerated processing unit (APU). These include GPU-only implementations with two edge distribution methods, GPU-side load balancing, CPU-GPU load balancing in a master-worker model with queue monitoring and in a work stealing model. We take advantage of the latest development of heterogeneous system architecture (HSA), such as the features of unified virtual address space and diverse atomics. We also use different memory scope and ordering options for different synchronization scenarios. We compare multiple implementations of betweenness centrality, analyze their performance, and discuss important future research directions.","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"105 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80691827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Session details: Short Papers Session 会议详情:简短论文会议
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/3260996
T. Suzumura
{"title":"Session details: Short Papers Session","authors":"T. Suzumura","doi":"10.1145/3260996","DOIUrl":"https://doi.org/10.1145/3260996","url":null,"abstract":"","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"72 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78135184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Session details: Full Papers Session 1 会议详情:全文会议1
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/3260993
T. Suzumura
{"title":"Session details: Full Papers Session 1","authors":"T. Suzumura","doi":"10.1145/3260993","DOIUrl":"https://doi.org/10.1145/3260993","url":null,"abstract":"","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"54 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90639953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Session details: Full Papers Session 3 会议细节:论文全文会议3
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/3260997
T. Suzumura
{"title":"Session details: Full Papers Session 3","authors":"T. Suzumura","doi":"10.1145/3260997","DOIUrl":"https://doi.org/10.1145/3260997","url":null,"abstract":"","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"47 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76510071","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Proceedings of the ACM Workshop on High Performance Graph Processing ACM高性能图形处理研讨会论文集
Proceedings of the ACM Workshop on High Performance Graph Processing Pub Date : 2016-05-31 DOI: 10.1145/2915516
T. Suzumura, D. García-Gasulla, Miyuru Dayarathna
{"title":"Proceedings of the ACM Workshop on High Performance Graph Processing","authors":"T. Suzumura, D. García-Gasulla, Miyuru Dayarathna","doi":"10.1145/2915516","DOIUrl":"https://doi.org/10.1145/2915516","url":null,"abstract":"It is our great pleasure to welcome you to the 2016 High Performance Graph Processing Workshop -- HPGP'16. This inaugural workshop of the HPGP workshop series is focused on multiple aspects of graph processing on high performance computing systems. The mission of the workshop is to serve as a platform for dissemination of cutting edge research conducted on high performance graph processing and identify new directions for future research and development. HPGP'16 provides researchers and practitioners a unique opportunity to share their perspectives with others interested in the various aspects of high performance graph processing. \u0000 \u0000The call for papers attracted submissions mainly from Asia and the United States. \u0000 \u0000We also encourage attendees to attend the keynote talk. This valuable and insightful talk can and will guide us to a better understanding of the future of high performance graph processing: \u0000Towards next-generation graph processing and management platform, Toyotaro Suzumura (who is currently at IBM T.J. Watson Research Center).","PeriodicalId":20568,"journal":{"name":"Proceedings of the ACM Workshop on High Performance Graph Processing","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2016-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74376712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信