咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是61-70 订阅
排序:
Deterministic and Low-Span Work-Efficient parallel Batch-Dynamic Trees  24
Deterministic and Low-Span Work-Efficient Parallel Batch-Dyn...
收藏 引用
36th ACM Symposium on parallelism in algorithms and Architectures (SPAA)
作者: Anderson, Daniel Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA
Dynamic trees are a well-studied and fundamental building block of dynamic graph algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81, (1981), pp. 114-122]. The problem is to maintain a tree s... 详细信息
来源: 评论
Scalable Fine-Grained parallel Cycle Enumeration algorithms  22
Scalable Fine-Grained Parallel Cycle Enumeration Algorithms
收藏 引用
34th ACM Symposium on parallelism in algorithms and Architectures (SPAA)
作者: Blanusa, Jovan Ienne, Paolo Atasu, Kubilay IBM Res Europe Zurich Switzerland Ecole Polytechn Federale Lausanne EPFL Sch Comp & Commun Sci CH-1015 Lausanne Switzerland
Enumerating simple cycles has important applications in computational biology, network science, and financial crime analysis. In this work, we focus on parallelising the state-of-the-art simple cycle enumeration algor... 详细信息
来源: 评论
A parallel algorithm for maximal matching based on depth first search
收藏 引用
parallel algorithms and Applications 1995年 第3-4期5卷 161-164页
作者: Datta, Alak K. Sen, Ranjan K. Department of Mathematics Indian Institute of Technology Kharagpur 721302 India Department of Computer Science and Engineering Indian Institute of Technology Kharagpur 721302 India
We present a new parallel algorithm for finding a maximal matching of a graph. The time required by our algorithm is O(TD(n)log n) and the number of processors used is PD(n), where TD(n) and PD(n) are the time and num... 详细信息
来源: 评论
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... 详细信息
来源: 评论
AM++: A Generalized Active Message Framework  10
AM++: A Generalized Active Message Framework
收藏 引用
19th International Conference on parallel Architectures and Compilation Techniques
作者: Willcock, Jeremiah J. Hoefler, Torsten Edmonds, Nicholas G. Lumsdaine, Andrew Indiana Univ Bloomington IN 47401 USA
Active messages have proven to be an effective approach for certain communication problems in high performance computing. Many MPI implementations, as well as runtimes for Partitioned Global Address Space languages, u... 详细信息
来源: 评论
Batch Updates of Distributed Streaming graphs using Linear Algebra
Batch Updates of Distributed Streaming Graphs using Linear A...
收藏 引用
2024 Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis, SC Workshops 2024
作者: Hassani, Elaheh Hussain, Md Taufique Azad, Ariful Indiana University Dept. of Intelligent Systems Engineering BloomingtonIN United States
We develop a distributed-memory parallel algorithm for performing batch updates on streaming graphs, where vertices and edges are continuously added or removed. Our algorithm leverages distributed sparse matrices as t... 详细信息
来源: 评论
SCCMulti: An Improved parallel Strongly Connected Components Algorithm
SCCMulti: An Improved Parallel Strongly Connected Components...
收藏 引用
作者: Tomkins, Daniel Smith, Timmie Amato, Nancy M. Rauchwerger, Lawrence Parasol Laboratory Department of Computer Science and Engineering Texas A and M University United States
来源: 评论
TeraHAC: Hierarchical Agglomerative Clustering of Trillion-Edge graphs
收藏 引用
Proceedings of the ACM on Management of Data 2023年 第3期1卷 1-27页
作者: Laxman Dhulipala Jakub Łącki Jason Lee Vahab Mirrokni UMD & Google Research Bethesda MD USA Google Research New York NY USA
We introduce TeraHAC, a (1+ε)-approximate hierarchical agglomerative clustering (HAC) algorithm which scales to trillion-edge graphs. Our algorithm is based on a new approach to computing (1+ε)-approximate HAC, whic... 详细信息
来源: 评论
IMPROVED parallel ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH
收藏 引用
parallel algorithms and Applications 2000年 第4期14卷 321-327页
作者: Alak Kumar Datta[a] Ranjan Kumar Sen - Present address: IBM Poughkeepsie USA[b] [a] Department of Computer Science and Technology Bengal Engineering College (DU) Howrah West Bengal India [b] Department of Computer Science Hampton University Hampton VA USA
Computation of maximal matching of a graph based on Depth First Search tree computation was introduced by Datta and Sen (parallel algorithms and Applications,5, 1995, 161-164). They showed that the approach gives effi... 详细信息
来源: 评论
Towards scaling community detection on distributed-memory heterogeneous systems
收藏 引用
parallel COMPUTING 2022年 111卷
作者: Gawande, Nitin Ghosh, Sayan Halappanavar, Mahantesh Tumeo, Antonino Kalyanaraman, Ananth Pacific Northwest Natl Lab Richland WA 99352 USA Washington State Univ Pullman WA 99164 USA Intel Corp Santa Clara CA USA PNNL Richland WA USA
In most real-world networks, nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters such that nodes within a community are more likely to be connected or related to one another ... 详细信息
来源: 评论