咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
Space and Time Efficient parallel graph Decomposition, Clustering, and Diameter Approximation  15
Space and Time Efficient Parallel Graph Decomposition, Clust...
收藏 引用
27th ACM symposium on parallelism in algorithms and Architectures (SPAA)
作者: Ceccarello, Matteo Pietracaprina, Andrea Pucci, Geppino Upfal, Eli Univ Padua Dept Informat Engn Padua Italy Brown Univ Dept Comp Sci Providence RI 02912 USA
We develop a novel parallel decomposition strategy for un-weighted, undirected graphs, based on growing disjoint connected clusters from batches of centers progressively selected from yet uncovered nodes. With respect... 详细信息
来源: 评论
parallel Batch-Dynamic graph Connectivity  19
Parallel Batch-Dynamic Graph Connectivity
收藏 引用
31st ACM Symposium on parallelism in algorithms and Architecturess (SPAA)
作者: Acar, Umut A. Anderson, Daniel Blelloch, Guy E. Dhulipala, Laxman Carnegie Mellon Univ Pittsburgh PA 15213 USA
In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. The best sequential algorithm for dynam... 详细信息
来源: 评论
Algorithm-Level Optimizations for Scalable parallel graph Processing
Algorithm-Level Optimizations for Scalable Parallel Graph Pr...
收藏 引用
作者: Harshvardhan Texas A&M University
Efficiently processing large graphs is challenging, since parallel graph algorithms suffer frompoor scalability and performance due to many factors, including heavy communication and load-imbalance.Furthermore, it is ... 详细信息
来源: 评论
DECENTRALIZED LOW-STRETCH TREES VIA LOW DIAMETER graph DECOMPOSITIONS
收藏 引用
SIAM JOURNAL ON COMPUTING 2024年 第2期53卷 247-286页
作者: Becker, Ruben Emek, Yuval Ghaffari, Mohsen Lenzen, Christoph CaFoscari Univ Venice I-30123 Venice Italy Technion Israel Inst Technol IL-3200003 Haifa Israel MIT Cambridge MA 02139 USA CISPA Helmholtz Ctr Informat Secur Saarland Informat Campus D-66123 Saarbrucken Germany
We study the problem of approximating the distances in an undirected weighted graph G by the distances in trees based on the notion of stretch. Focusing on decentralized models of computation such as the CONGEST, PRAM... 详细信息
来源: 评论
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
收藏 引用
JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2006年 第11期66卷 1366-1378页
作者: Bader, David A. Cong, Guojing Georgia Inst Technol Coll Comp Atlanta GA 30332 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA
Minimum spanning tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent problems in biology and medicine such ... 详细信息
来源: 评论
BFS-4K: An Efficient Implementation of BFS for Kepler GPU Architectures
收藏 引用
IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2015年 第7期26卷 1826-1838页
作者: Busato, Federico Bombieri, Nicola Univ Verona Dept Comp Sci I-37100 Verona Italy
Breadth-first search (BFS) is one of the most common graph traversal algorithms and the building block for a wide range of graph applications. With the advent of graphics processing units (GPUs), several works have be... 详细信息
来源: 评论
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... 详细信息
来源: 评论
FINDING LOWEST COMMON ANCESTORS IN parallel
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1986年 第8期35卷 764-769页
作者: TSIN, YH MEM UNIV NEWFOUNDLAND DEPT COMP SCIST JOHNS A1C 5S7NEWFOUNDLANDCANADA
Two parallel algorithms for finding the lowest common ancestors of a set of vertex pairs Q (the query set) in a directed tree are presented. With all the overheads taken into account, these algorithms take O((n + QI) ... 详细信息
来源: 评论
Portable and efficient parallel computing using the BSP model
收藏 引用
IEEE TRANSACTIONS ON COMPUTERS 1999年 第7期48卷 670-689页
作者: Goudreau, MW Lang, K Rao, SB Suel, T Tsantilas, T NEC US C&C Res Labs Princeton NJ 08540 USA Polytech Univ Brooklyn NY 11201 USA Bear Stearns & Co New York NY 10167 USA
The Bulk-Synchronous parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware. In theory. the BSP model has been shown to allow the asymptotically optimal execution o... 详细信息
来源: 评论
graph coloring algorithms for multi-core and massively multithreaded architectures
收藏 引用
parallel COMPUTING 2012年 第10-11期38卷 576-594页
作者: Catalyuerek, Uemit V. Feo, John Gebremedhin, Assefaw H. Halappanavar, Mahantesh Pothen, Alex Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA Ohio State Univ Dept Biomed Informat Columbus OH 43210 USA Pacific NW Natl Lab Richland WA 99352 USA Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA
We explore the interplay between architectures and algorithm design in the context of shared-memory platforms and a specific graph problem of central importance in scientific and high-performance computing, distance-1... 详细信息
来源: 评论