咨询与建议

限定检索结果

文献类型

  • 1,504 篇 会议
  • 105 篇 期刊文献

馆藏范围

  • 1,609 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,168 篇 工学
    • 1,111 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 579 篇 理学
    • 557 篇 数学
    • 55 篇 统计学(可授理学、...
    • 16 篇 物理学
    • 9 篇 生物学
    • 9 篇 系统科学
    • 8 篇 化学
  • 73 篇 管理学
    • 64 篇 管理科学与工程(可...
    • 40 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 16 篇 农学
    • 16 篇 作物学
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 3 篇 法学
    • 3 篇 社会学
  • 3 篇 教育学
    • 3 篇 教育学
  • 2 篇 医学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 237 篇 parallel algorit...
  • 173 篇 parallel process...
  • 80 篇 computer archite...
  • 74 篇 parallel process...
  • 57 篇 parallel program...
  • 55 篇 algorithms
  • 47 篇 parallel archite...
  • 41 篇 hardware
  • 30 篇 scheduling
  • 27 篇 computer program...
  • 21 篇 graph algorithms
  • 20 篇 computer systems...
  • 18 篇 approximation al...
  • 18 篇 processor schedu...
  • 18 篇 computational mo...
  • 18 篇 field programmab...
  • 17 篇 parallel computi...
  • 16 篇 computer science
  • 16 篇 performance
  • 16 篇 delay

机构

  • 32 篇 carnegie mellon ...
  • 15 篇 swiss fed inst t...
  • 15 篇 carnegie mellon ...
  • 11 篇 univ maryland de...
  • 11 篇 stanford univ st...
  • 10 篇 univ maryland co...
  • 10 篇 mit 77 massachus...
  • 10 篇 univ calif berke...
  • 8 篇 eth zurich
  • 7 篇 georgetown univ ...
  • 7 篇 mit cambridge ma...
  • 7 篇 univ texas austi...
  • 6 篇 penn state univ ...
  • 6 篇 mit csail cambri...
  • 5 篇 univ calif river...
  • 5 篇 princeton univer...
  • 5 篇 university of ma...
  • 5 篇 microsoft res re...
  • 5 篇 carnegie mellon ...
  • 5 篇 harvard univ cam...

作者

  • 38 篇 blelloch guy e.
  • 20 篇 gu yan
  • 18 篇 gibbons phillip ...
  • 18 篇 shun julian
  • 18 篇 goodrich michael...
  • 16 篇 fineman jeremy t...
  • 15 篇 sun yihan
  • 14 篇 dhulipala laxman
  • 13 篇 vishkin uzi
  • 12 篇 agrawal kunal
  • 11 篇 leiserson charle...
  • 10 篇 ballard grey
  • 10 篇 hoefler torsten
  • 10 篇 anon
  • 10 篇 miller gary l.
  • 10 篇 harris david g.
  • 9 篇 ghaffari mohsen
  • 9 篇 tangwongsan kana...
  • 9 篇 reif john h.
  • 9 篇 demmel james

语言

  • 1,569 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1609 条 记 录,以下是541-550 订阅
排序:
Brief Announcement: Hypergraph Partitioning for parallel Sparse Matrix-Matrix Multiplication  27
Brief Announcement: Hypergraph Partitioning for Parallel Spa...
收藏 引用
27th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Ballard, Grey Druinsky, Alex Knight, Nicholas Schwartz, Oded Sandia Natl Labs Livermore CA 94550 USA Lawrence Berkeley Natl Lab Berkeley CA USA Univ Calif Berkeley Berkeley CA 94720 USA Hebrew Univ Jerusalem Jerusalem Israel
The performance of parallel algorithms for sparse matrixmatrix multiplication is typically determined by the amount of interprocessor communication performed, which in turn depends on the nonzero structure of the inpu... 详细信息
来源: 评论
Interprocessor communication speed and performance in distributed-memory parallel processors.  89
Interprocessor communication speed and performance in distri...
收藏 引用
16th annual International symposium on Computer Architecture
作者: Annaratone, Marco Pommerell, Claude Ruhl, Roland Swiss Fed Inst of Technology Zurich Switz
The authors have simulated several numerical and nonnumerical algorithms on five distributed-memory parallel processors (DMPPs). All five DMPPs have the same topology (a torus) and the same number of nodes. The archit... 详细信息
来源: 评论
Randomized Incremental Convex Hull is Highly parallel  20
Randomized Incremental Convex Hull is Highly Parallel
收藏 引用
32nd acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Blelloch, Guy E. Gu, Yan Shun, Julian Sun, Yihan Carnegie Mellon Univ Pittsburgh PA 15213 USA UC Riverside Riverside CA USA MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA
The randomized incremental convex hull algorithm is one of the most practical and important geometric algorithms in the literature. Due to its simplicity, and the fact that many points or facets can be added independe... 详细信息
来源: 评论
A constant-time optimal parallel string-matching algorithm  92
A constant-time optimal parallel string-matching algorithm
收藏 引用
24th annual acm symposium on Theory of Computing, STOC 1992
作者: Galil, Zvi Columbia University United States Tel-Aviv University Israel
Given a pattern string, we describe a way to preprocess it. We design a constant-time optimal parallel algorithm for finding all occurrences of the (prepro-cessed) pattern in any given text.
来源: 评论
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms  13
Minimizing randomness in minimum spanning tree, parallel con...
收藏 引用
13th annual acm/SIAM symposium on Discrete algorithms
作者: Pettie, S Ramachandran, V Univ Texas Dept Comp Sci Austin TX 78712 USA
There are several fundamental problems for which there are optimal randomized algorithms, but whose deterministic complexity remains unresolved. Among such problems are the minimum spanning tree problem, the set maxim... 详细信息
来源: 评论
An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model  2019
An Optimal Approximation for Submodular Maximization under a...
收藏 引用
51st annual acm SIGACT symposium on Theory of Computing (STOC)
作者: Balkanski, Eric Rubinstein, Aviad Singer, Yaron Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA Stanford Univ Dept Comp Sci Stanford CA 94305 USA
In this paper we study submodular maximization under a matroid constraint in the adaptive complexity model. This model was recently introduced in the context of submodular optimization to quantify the information theo... 详细信息
来源: 评论
Control Flow Coalescing on a Hybrid Dataflow/von Neumann GPGPU  48
Control Flow Coalescing on a Hybrid Dataflow/von Neumann GPG...
收藏 引用
48th annual IEEE/acm International symposium on Microarchitecture (MICRO)
作者: Voitsechov, Dani Etsion, Yoav Technion Israel Inst Technol Elect Engn Haifa Israel Technion Israel Inst Technol Elect Engn IL-32000 Haifa Israel Technion Israel Inst Technol Elect Engn & Comp Sci IL-32000 Haifa Israel
We propose the hybrid dataflow/von Neumann vector graph instruction word (VGIW) architecture. This data-parallel architecture concurrently executes each basic block's dataflow graph (graph instruction word) for a ... 详细信息
来源: 评论
parallel algorithms and concentration bounds for the Lovasz Local Lemma via witness-DAGs  28
Parallel algorithms and concentration bounds for the Lovasz ...
收藏 引用
28th annual acm-SIAM symposium on Discrete algorithms (SODA)
作者: Haeupler, Bernhard Harris, David G. Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA
The Lovasz Local Lemma (LLL) is a cornerstone principle in the probabilistic method of combinatorics, and a seminal algorithm of Moser & Tardos (2010) provides an efficient randomized algorithm to implement it. Th... 详细信息
来源: 评论
PROCEEDINGS OF THE NINETEENTH annual acm symposium ON THEORY OF COMPUTING.
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM SYMPOSIUM ON THEORY...
收藏 引用
Proceedings of the Nineteenth annual acm symposium on Theory of Computing.
作者: Anon
This conference proceedings contains 50 papers. The topics covered include: algorithms;graph theory;parallel processing;automata;Boolean circuits;computational geometry;cryptography;complexity;distributed computing.
来源: 评论
String matching with wildcards in the massively parallel computation model  21
String matching with wildcards in the massively parallel com...
收藏 引用
33rd acm symposium on parallelism in algorithms and architectures, SPAA 2021
作者: Hajiaghayi, Mohammadtaghi Saleh, Hamed Seddighin, Saeed Sun, Xiaorui University of Maryland College ParkMD United States Toyota Technological Institute ChicagoIL United States University of Illinois ChicagoIL United States
We study distributed algorithms for string matching problem in presence of wildcard characters. Given a string T (a text), we look for all occurrences of another string P (a pattern) as a substring of string T. Each w... 详细信息
来源: 评论