咨询与建议

限定检索结果

文献类型

  • 39 篇 会议
  • 32 篇 期刊文献
  • 1 篇 学位论文

馆藏范围

  • 72 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 69 篇 工学
    • 65 篇 计算机科学与技术...
    • 20 篇 软件工程
    • 17 篇 电气工程
    • 4 篇 信息与通信工程
    • 2 篇 控制科学与工程
    • 1 篇 机械工程
    • 1 篇 电子科学与技术(可...
    • 1 篇 网络空间安全
  • 10 篇 理学
    • 10 篇 数学
  • 3 篇 管理学
    • 2 篇 管理科学与工程(可...
    • 1 篇 图书情报与档案管...
  • 2 篇 法学
    • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 文学
    • 1 篇 新闻传播学
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...
    • 1 篇 临床医学

主题

  • 72 篇 parallel graph a...
  • 6 篇 gpu
  • 5 篇 mapreduce
  • 4 篇 algorithms
  • 4 篇 community detect...
  • 3 篇 graph algorithms
  • 3 篇 cuda
  • 3 篇 matching
  • 3 篇 graph mining
  • 3 篇 high-performance...
  • 3 篇 generic programm...
  • 3 篇 pgas
  • 3 篇 high performance...
  • 3 篇 distributed comp...
  • 3 篇 graph processing
  • 3 篇 graph coloring
  • 2 篇 performance
  • 2 篇 active messages
  • 2 篇 graph analytics
  • 2 篇 gpgpu

机构

  • 4 篇 carnegie mellon ...
  • 3 篇 brown univ dept ...
  • 2 篇 univ warsaw inte...
  • 2 篇 pacific nw natl ...
  • 2 篇 univ padua dept ...
  • 2 篇 ibm corp tj wats...
  • 2 篇 georgia inst tec...
  • 2 篇 indiana univ ope...
  • 2 篇 nicolaus coperni...
  • 2 篇 washington state...
  • 2 篇 swiss fed inst t...
  • 2 篇 washington state...
  • 1 篇 univ connecticut...
  • 1 篇 fayetteville sta...
  • 1 篇 dept.of computer...
  • 1 篇 cispa helmholtz ...
  • 1 篇 ibm corp tj wats...
  • 1 篇 ohio state univ ...
  • 1 篇 univ nebraska om...
  • 1 篇 agh univ sci & t...

作者

  • 7 篇 halappanavar mah...
  • 6 篇 kalyanaraman ana...
  • 5 篇 blelloch guy e.
  • 4 篇 hoefler torsten
  • 4 篇 dhulipala laxman
  • 3 篇 ceccarello matte...
  • 3 篇 pucci geppino
  • 3 篇 lumsdaine andrew
  • 3 篇 besta maciej
  • 3 篇 upfal eli
  • 3 篇 shun julian
  • 3 篇 pietracaprina an...
  • 2 篇 cong guojing
  • 2 篇 kaya kamer
  • 2 篇 bhowmick sanjukt...
  • 2 篇 lumsdaine a
  • 2 篇 blanusa jovan
  • 2 篇 ryczkowska magda...
  • 2 篇 ienne paolo
  • 2 篇 bader david a.

语言

  • 71 篇 英文
  • 1 篇 其他
检索条件"主题词=Parallel Graph Algorithms"
72 条 记 录,以下是31-40 订阅
Performance Comparison of graph BFS Implemented in MapReduce and PGAS Programming Models  12th
Performance Comparison of Graph BFS Implemented in MapReduce...
收藏 引用
12th International Conference on parallel Processing and Applied Mathematics (PPAM)
作者: Ryczkowska, Magdalena Nowicki, Marek Univ Warsaw Interdisciplinary Ctr Math & Computat Modeling Pawinskiego 5a PL-02106 Warsaw Poland Nicolaus Copernicus Univ Fac Math & Comp Sci Chopina 12-18 PL-87100 Torun Poland
Computations based on graphs are very common problems but complexity, increasing size of analyzed graphs and a huge amount of communication make this analysis a challenging task. In this paper, we present a comparison... 详细信息
来源: 评论
Fast Approximate Distance Queries in Unweighted graphs Using Bounded Asynchrony  1
收藏 引用
29th International Workshop on Languages and Compilers for parallel Computing (LCPC)
作者: Fidel, Adam Sabido, Francisco Coral Riedel, Colton Amato, Nancy M. Rauchwerger, Lawrence Texas A&M Univ Dept Comp Sci & Engn Parasol Lab College Stn TX 77843 USA
We introduce a new parallel algorithm for approximate breadth-first ordering of an unweighted graph by using bounded asynchrony to parametrically control both the performance and error of the algorithm. This work is b... 详细信息
来源: 评论
Distributed, Shared-Memory parallel Triangle Counting  18
Distributed, Shared-Memory Parallel Triangle Counting
收藏 引用
5th Platform for Advanced Scientific Computing Conference (PASC)
作者: Kanewala, Thejaka Amila Zalewski, Marcin Lumsdaine, Andrew Indiana Univ Sch Informat Comp & Engn Bloomington IN 47405 USA Pacific Northwest Natl Lab Seattle WA USA Univ Washington Seattle WA 98195 USA
Triangles are the most basic non-trivial subgraphs. Triangle counting is used in a number of different applications, including social network mining, cyber security, and spam detection. In general, triangle counting a... 详细信息
来源: 评论
Towards a graphBLAS Library in Chapel  31
Towards a GraphBLAS Library in Chapel
收藏 引用
31st IEEE International parallel and Distributed Processing Symposium Workshops (IPDPS)
作者: Azad, Ariful Buluc, Aydin Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA 94720 USA
The adoption of a programming language is positively influenced by the breadth of its software libraries. Chapel is a modern and relatively young parallel programming language. Consequently, not many domain-specific s... 详细信息
来源: 评论
Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components
收藏 引用
FORMAL METHODS IN SYSTEM DESIGN 2016年 第3期48卷 274-300页
作者: Wijs, Anton Katoen, Joost-Pieter Bosnacki, Dragan Eindhoven Univ Technol Eindhoven Netherlands Rhein Westfal TH Aachen Aachen Germany
This article presents parallel algorithms for component decomposition of graph structures on general purpose graphics processing units (GPUs). In particular, we consider the problem of decomposing sparse graphs into s... 详细信息
来源: 评论
An Efficient GPU Implementation of Inclusion-Based Pointer Analysis
收藏 引用
IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2016年 第2期27卷 353-366页
作者: Su, Yu Ye, Ding Xue, Jingling Liao, Xiang-Ke UNSW Sch Comp Sci & Engn Programming Language & Compilers Grp Sydney NSW Australia Natl Univ Def Technol Sch Comp Sci Changsha Hunan Peoples R China
We present an efficient GPU implementation of Andersen's whole-program inclusion-based pointer analysis, a fundamental analysis on which many others are based, including optimising compilers, bug detection and sec... 详细信息
来源: 评论
A Practical parallel Algorithm for Diameter Approximation of Massive Weighted graphs  30
A Practical Parallel Algorithm for Diameter Approximation of...
收藏 引用
30th IEEE International parallel and Distributed Processing Symposium (IPDPS)
作者: Ceccarello, Matteo Pietracaprina, Andrea Pucci, Geppino Upfal, Eli Univ Padua Dept Informat Engn Padua Italy Brown Univ Dept Comp Sci Providence RI USA
We present a space and time efficient practical parallel algorithm for approximating the diameter of massive weighted undirected graphs on distributed platforms supporting a MapReduce-like abstraction. The core of the... 详细信息
来源: 评论
NetworKit: A tool suite for large-scale complex network analysis
收藏 引用
NETWORK SCIENCE 2016年 第4期4卷 508-530页
作者: Staudt, Christian L. Sazonovs, Aleksejs Meyerhenke, Henning Karlsruhe Inst Technol Inst Theoret Informat D-76131 Karlsruhe Germany Wellcome Trust Sanger Inst Wellcome Genome Campus Cambridge CB10 1SA England
We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly common large graph data sets contain... 详细信息
来源: 评论
Counting Triangles in Large graphs on GPU  30
Counting Triangles in Large Graphs on GPU
收藏 引用
30th IEEE International parallel and Distributed Processing Symposium (IPDPS)
作者: Polak, Adam Jagiellonian Univ Fac Math & Comp Sci Dept Theoret Comp Sci Krakow Poland
The clustering coefficient and the transitivity ratio are concepts often used in network analysis, which creates a need for fast practical algorithms for counting triangles in large graphs. Previous research in this a... 详细信息
来源: 评论
The Performance Evaluation of the Java Implementation of graph500  11th
The Performance Evaluation of the Java Implementation of Gra...
收藏 引用
11th International Conference on parallel Processing and Applied Mathematics (PPAM)
作者: Ryczkowska, Magdalena Nowicki, Marek Bala, Piotr Nicolaus Copernicus Univ Fac Math & Comp Sci Chopina 12-18 PL-87100 Torun Poland Univ Warsaw Interdisciplinary Ctr Math & Computat Modeling Pawinskiego 5a PL-02106 Warsaw Poland
graph-based computations are used in many applications. Increasing size of analyzed data and its complexity make graph analysis a challenging task. In this paper we present performance evaluation of Java implementatio... 详细信息
来源: 评论