咨询与建议

限定检索结果

文献类型

  • 5,672 篇 会议
  • 3,456 篇 期刊文献
  • 42 篇 学位论文
  • 4 册 图书
  • 1 篇 资讯

馆藏范围

  • 9,175 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 5,484 篇 工学
    • 4,478 篇 计算机科学与技术...
    • 1,617 篇 软件工程
    • 1,420 篇 电气工程
    • 448 篇 信息与通信工程
    • 296 篇 控制科学与工程
    • 268 篇 电子科学与技术(可...
    • 94 篇 仪器科学与技术
    • 75 篇 机械工程
    • 74 篇 力学(可授工学、理...
    • 63 篇 动力工程及工程热...
    • 63 篇 化学工程与技术
    • 61 篇 生物工程
    • 55 篇 生物医学工程(可授...
    • 51 篇 农业工程
    • 45 篇 材料科学与工程(可...
    • 44 篇 土木工程
    • 40 篇 光学工程
    • 30 篇 建筑学
  • 2,404 篇 理学
    • 1,984 篇 数学
    • 311 篇 物理学
    • 149 篇 统计学(可授理学、...
    • 113 篇 系统科学
    • 97 篇 生物学
    • 89 篇 化学
  • 506 篇 管理学
    • 390 篇 管理科学与工程(可...
    • 123 篇 图书情报与档案管...
    • 76 篇 工商管理
  • 81 篇 医学
    • 58 篇 临床医学
  • 68 篇 农学
    • 62 篇 作物学
  • 34 篇 经济学
    • 32 篇 应用经济学
  • 28 篇 法学
  • 13 篇 文学
  • 7 篇 教育学
  • 5 篇 艺术学
  • 4 篇 军事学

主题

  • 9,175 篇 parallel algorit...
  • 1,158 篇 concurrent compu...
  • 847 篇 algorithm design...
  • 672 篇 parallel process...
  • 616 篇 computer science
  • 460 篇 computational mo...
  • 374 篇 computer archite...
  • 289 篇 phase change ran...
  • 233 篇 application soft...
  • 224 篇 parallel archite...
  • 215 篇 hypercubes
  • 200 篇 very large scale...
  • 198 篇 costs
  • 196 篇 parallel program...
  • 176 篇 sorting
  • 175 篇 scalability
  • 165 篇 hardware
  • 152 篇 data mining
  • 147 篇 routing
  • 144 篇 clustering algor...

机构

  • 26 篇 carnegie mellon ...
  • 19 篇 school of electr...
  • 17 篇 department of co...
  • 17 篇 ibm thomas j. wa...
  • 16 篇 department of co...
  • 15 篇 old dominion uni...
  • 15 篇 hiroshima univ d...
  • 13 篇 purdue univ dept...
  • 13 篇 univ texas dept ...
  • 12 篇 georgia inst tec...
  • 12 篇 univ maryland de...
  • 12 篇 old dominion uni...
  • 12 篇 school of comput...
  • 11 篇 swiss fed inst t...
  • 11 篇 univ maryland co...
  • 11 篇 univ maryland in...
  • 10 篇 georgia inst tec...
  • 10 篇 department of co...
  • 10 篇 department of co...
  • 10 篇 eth zurich

作者

  • 35 篇 shun julian
  • 33 篇 olariu s
  • 30 篇 p. banerjee
  • 30 篇 blelloch guy e.
  • 26 篇 nakano koji
  • 24 篇 bader david a.
  • 18 篇 dhulipala laxman
  • 18 篇 gu yan
  • 17 篇 ito yasuaki
  • 16 篇 schwing jl
  • 15 篇 v. kumar
  • 15 篇 khan maleq
  • 14 篇 sun yihan
  • 14 篇 shi-jinn horng
  • 14 篇 vishkin uzi
  • 13 篇 ballard grey
  • 13 篇 takefuji y
  • 13 篇 banerjee p
  • 13 篇 han yj
  • 12 篇 ramachandran v

语言

  • 8,734 篇 英文
  • 361 篇 其他
  • 60 篇 中文
  • 9 篇 俄文
  • 4 篇 德文
  • 3 篇 西班牙文
  • 2 篇 法文
检索条件"主题词=Parallel algorithms"
9175 条 记 录,以下是621-630 订阅
排序:
Performance portable Vlasov code with C++ parallel algorithm
Performance portable Vlasov code with C++ parallel algorithm
收藏 引用
Performance, Portability and Productivity in HPC (P3HPC)
作者: Yuuichi Asahi Thomas Padioleau Guillaume Latu Julien Bigot Virginie Grandgirard Kevin Obrejan CCSE Japan Atomic Energy Agency Chiba Japan Université Paris-Saclay UVSQ CNRS CEA Maison de la Simulation Gif-sur-Yvette France DES/IRESNE/DEC CEA St.Paul-lez-Durance France IRFM CEA St.Paul-lez-Durance France
This paper presents the performance portable implementation of a kinetic plasma simulation code with C++ parallel algorithm to run across multiple CPUs and GPUs. Relying on the language standard parallelism stdpar and... 详细信息
来源: 评论
GPU-Accelerated Batch-Dynamic Subgraph Matching
GPU-Accelerated Batch-Dynamic Subgraph Matching
收藏 引用
International Conference on Data Engineering
作者: Linshan Qiu Lu Chen Hailiang Jie Xiangyu Ke Yunjun Gao Yang Liu Zetao Zhang Zhejiang University Hangzhou China Huawei Chengdu China
Subgraph matching has garnered increasing attention for its diverse real-world applications. Given the dynamic nature of real-world graphs, addressing evolving scenarios with-out incurring prohibitive overheads has be... 详细信息
来源: 评论
Optimal Preprocessing for Answering On-Line Product Queries
arXiv
收藏 引用
arXiv 2024年
作者: Alon, Noga Schieber, Baruch Department of Mathematics School of Mathematical Sciences Tel Aviv University Tel Aviv69978 Israel Department of Computer Science School of Mathematical Sciences Tel Aviv University Tel Aviv69978 Israel
We examine the amount of preprocessing needed for answering certain on-line queries as fast as possible. We start with the following basic problem. Suppose we are given a semigroup (S, ◦). Let s1, . . ., sn be element... 详细信息
来源: 评论
Deterministic Low-Diameter Decompositions for Weighted Graphs and Distributed and parallel Applications
Deterministic Low-Diameter Decompositions for Weighted Graph...
收藏 引用
Annual IEEE Symposium on Foundations of Computer Science
作者: Václav Rozhoň Michael Elkin Christoph Grunau Bernhard Haeupler ETH Zurich Ben-Gurion University of the Negev ETH Zurich & Carnegie Mellon University
This paper presents new deterministic and distributed low-diameter decomposition algorithms for weighted graphs. In particular, we show that if one can efficiently compute approximate distances in a parallel or a dist... 详细信息
来源: 评论
MST in Incremental Graphs Through Tree Contractions
MST in Incremental Graphs Through Tree Contractions
收藏 引用
IEEE Conference on High Performance Extreme Computing (HPEC)
作者: Akanksha Dwivedi Sameer Sharma Dip Sankar Banerjee Department of Computer Science and Engineering Indian Institute of Technology Jodhpur India
Dynamic graphs, characterized by rapid changes in their topological structure through adding or deleting edges or vertices, pose significant challenges for algorithm design. This paper presents a parallel algorithm fo... 详细信息
来源: 评论
Efficient Enumeration of Large Maximal k-Plexes
arXiv
收藏 引用
arXiv 2024年
作者: Cheng, Qihao Yan, Da Wu, Tianhao Yuan, Lyuheng Cheng, Ji Huang, Zhongyi Zhou, Yang Tsinghua University China Indiana University Bloomington United States HKUST Hong Kong Auburn University United States
Finding cohesive subgraphs in a large graph has many important applications, such as community detection and biological network analysis. Clique is often a too strict cohesive structure since communities or biological... 详细信息
来源: 评论
An Optimal MPC Algorithm for Subunit-Monge Matrix Multiplication, with Applications to LIS
arXiv
收藏 引用
arXiv 2024年
作者: Koo, Jaehyun MIT United States
We present an O(1)-round fully-scalable deterministic massively parallel algorithm for computing the min-plus matrix multiplication of unit-Monge matrices. We use this to derive a O(log n)-round fully-scalable massive... 详细信息
来源: 评论
Enhancing Text Summarization through parallelization: A TF-IDF Algorithm Approach
Enhancing Text Summarization through Parallelization: A TF-I...
收藏 引用
Intelligent Cyber Physical Systems and Internet of Things (ICoICI), International Conference on
作者: Diwesh Chaurasia Prof. Vimala Devi K Mudit Bhatta School of Computer Science and Engineering Vellore Institute of Technology Vellore Tamil Nadu India
Text parallelization is a crucial aspect of natural language processing, aiming to enhance the efficiency of information retrieval and analysis. This project focuses on leveraging the Term Frequency-Inverse Document F... 详细信息
来源: 评论
Constant-Memory Graph Coarsening
Constant-Memory Graph Coarsening
收藏 引用
IEEE Conference on High Performance Extreme Computing (HPEC)
作者: George M. Slota Christopher Brissette Rensselaer Polytechnic Institute
Graph coarsening is an important step for many multi-level algorithms, most notably graph partitioning. However, such methods often utilize an iterative approach, where a new coarser graph representation is explicitly... 详细信息
来源: 评论
An Adaptive Asynchronous Approach for the Single-Source Shortest Paths Problem
An Adaptive Asynchronous Approach for the Single-Source Shor...
收藏 引用
High Performance Computing, Networking, Storage and Analysis, SC-W: Workshops of the International Conference for
作者: Ritvik Rao Kavitha Chandrasekar Laxmikant Kale University of Illinois Urbana IL USA
Large-scale graphs with billions and trillions of vertices and edges require efficient parallel algorithms for common graph problems, one of which is single-source shortest paths (SSSP). Bulk-synchronous parallel algo... 详细信息
来源: 评论