咨询与建议

限定检索结果

文献类型

  • 2 篇 会议
  • 1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 3 篇 工学
    • 3 篇 电气工程
    • 3 篇 计算机科学与技术...
    • 1 篇 软件工程

主题

  • 3 篇 shared-memory pa...
  • 1 篇 parallel algorit...
  • 1 篇 sparse matrix-sp...
  • 1 篇 graph partitioni...
  • 1 篇 dynamic networks
  • 1 篇 gpu implementati...
  • 1 篇 graphblas
  • 1 篇 single source sh...
  • 1 篇 spectral method
  • 1 篇 wireless sensor ...
  • 1 篇 complexity theor...
  • 1 篇 graphics process...
  • 1 篇 spmspv
  • 1 篇 work-effeciency
  • 1 篇 multicore proces...
  • 1 篇 synchronization
  • 1 篇 heuristic algori...

机构

  • 1 篇 univ tsukuba dep...
  • 1 篇 virginia commonw...
  • 1 篇 lawrence berkele...
  • 1 篇 missouri univ sc...
  • 1 篇 univ north texas...
  • 1 篇 univ oregon dept...

作者

  • 1 篇 khanda arindam
  • 1 篇 srinivasan srira...
  • 1 篇 bhowmick sanjukt...
  • 1 篇 futamura yasunor...
  • 1 篇 azad ariful
  • 1 篇 wakaki ryota
  • 1 篇 sakurai tetsuya
  • 1 篇 buluc aydin
  • 1 篇 norris boyana
  • 1 篇 das sajal k.

语言

  • 3 篇 英文
检索条件"主题词=shared-memory parallel algorithm"
3 条 记 录,以下是1-10 订阅
A parallel algorithm Template for Updating Single-Source Shortest Paths in Large-Scale Dynamic Networks
收藏 引用
IEEE TRANSACTIONS ON parallel AND DISTRIBUTED SYSTEMS 2022年 第4期33卷 929-940页
作者: Khanda, Arindam Srinivasan, Sriram Bhowmick, Sanjukta Norris, Boyana Das, Sajal K. Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA Virginia Commonwealth Univ Dept Radiat Oncol Richmond VA 23284 USA Univ North Texas Dept Comp Sci & Engn Denton TX 76201 USA Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA
The Single Source Shortest Path (SSSP) problem is a classic graph theory problem that arises frequently in various practical scenarios;hence, many parallel algorithms have been developed to solve it. However, these al... 详细信息
来源: 评论
Spectral Graph Partitioning Using Geodesic Distance-based Projection
Spectral Graph Partitioning Using Geodesic Distance-based Pr...
收藏 引用
IEEE High Performance Extreme Computing Conference (HPEC)
作者: Futamura, Yasunori Wakaki, Ryota Sakurai, Tetsuya Univ Tsukuba Dept Comp Sci Tsukuba Ibaraki Japan
The graph partitioning problem is one of the most fundamental combinatorial problems with a wide variety of applications. In this paper, we propose an efficient approach for implementing spectral graph partitioning th... 详细信息
来源: 评论
A work-efficient parallel sparse matrix-sparse vector multiplication algorithm  31
A work-efficient parallel sparse matrix-sparse vector multip...
收藏 引用
31st IEEE International parallel and Distributed Processing Symposium (IPDPS)
作者: Azad, Ariful Buluc, Aydin Lawrence Berkeley Natl Lab Computat Res Div Berkeley CA 94720 USA
We design and develop a work-efficient multithreaded algorithm for sparse matrix-sparse vector multiplication (SpMSpV) where the matrix, the input vector, and the output vector are all sparse. SpMSpV is an important p... 详细信息
来源: 评论