咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是451-460 订阅
排序:
Proceedings of the acm symposium on Applied Computing
Proceedings of the ACM Symposium on Applied Computing
收藏 引用
30th annual acm symposium on Applied Computing, SAC 2015
The proceedings contain 367 papers. The topics discussed include: inference of disease-specific gene interaction network using a Bayesian network learned by genetic algorithm;P-SaMI: a data-flow pattern to perform mas...
来源: 评论
Help!  15
Help!
收藏 引用
34th annual acm symposium on Principles of Distributed Computing (PODC)
作者: Censor-Hillel, Keren Petrank, Erez Timnat, Shahar Technion Dept Comp Sci IL-32000 Haifa Israel
A fundamental challenge in designing concurrent data structures is obtaining efficient wait-free implementations, in which each operation completes regardless of the behavior of other operations in the system. The mos... 详细信息
来源: 评论
Session details: Session 9: parallel and Distributed algorithms  15
Session details: Session 9: Parallel and Distributed Algorit...
收藏 引用
Proceedings of the 27th acm symposium on parallelism in algorithms and architectures
作者: Benjamin Moseley Washington University in St. Louis
No abstract available.
来源: 评论
Sequential Random Permutation, List Contraction and Tree Contraction are Highly parallel  15
Sequential Random Permutation, List Contraction and Tree Con...
收藏 引用
annual acm-Society for Industrial and Applied Mathmatics symposium on Discrete algorithms
作者: Julian Shun Yan Gu Guy E. Blelloch Jeremy T. Fineman Phillip B. Gibbons Carnegie Mellon University Georgetown University Intel Labs and Carnegie Mellon University
We show that simple sequential randomized iterative algorithms for random permutation, list contraction, and tree contraction are highly parallel. In particular, if iterations of the algorithms are run as soon as all ...
来源: 评论
Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in parallel  15
Using Optimization to Break the Epsilon Barrier: A Faster an...
收藏 引用
annual acm-SIAM symposium on Discrete algorithms
作者: Zeyuan Allen-Zhu Lorenzo Orecchia MIT CSAIL MIT Math
We study the design of nearly-linear-time algorithms for approximately solving positive linear programs. Both the parallel and the sequential deterministic versions of these algorithms require O(ε~(-4)) iterations, a... 详细信息
来源: 评论
ARC 2014: A Multidimensional FPGA-Based parallel DBSCAN Architecture
收藏 引用
acm TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS 2015年 第1期9卷 2-2页
作者: Scicluna, Neil Bouganis, Christos-Savvas Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn London SW7 2AZ England
Clustering large numbers of data points is a very computationally demanding task that often needs to be accelerated in order to be useful in practical applications. This work focuses on the Density-Based Spatial Clust... 详细信息
来源: 评论
Exploring the Design Space of SPMD Divergence Management on Data-parallel architectures  47
Exploring the Design Space of SPMD Divergence Management on ...
收藏 引用
47th annual IEEE/acm International symposium on Microarchitecture (MICRO)
作者: Lee, Yunsup Grover, Vinod Krashinsky, Ronny Stephenson, Mark Keckler, Stephen W. Asanovic, Krste Univ Calif Berkeley Berkeley CA 94720 USA NVIDIA Santa Clara CA USA Univ Texas Austin Austin TX 78712 USA
Data-parallel architectures must provide efficient support for complex control-flow constructs to support sophisticated applications coded in modern single-program multiple-data languages. As these architectures have ... 详细信息
来源: 评论
Hypergraph Partitioning for parallel Sparse Matrix-Matrix Multiplication  15
Hypergraph Partitioning for Parallel Sparse Matrix-Matrix Mu...
收藏 引用
Proceedings of the 27th acm symposium on parallelism in algorithms and architectures
作者: Grey Ballard Alex Druinsky Nicholas Knight Oded Schwartz Sandia National Laboratories Livermore CA USA Lawrence Berkeley National Laboratory Berkeley CA USA University of California Berkeley Berkeley CA USA Hebrew University Jerusalem Israel
The performance of parallel algorithms for sparse matrix-matrix multiplication is typically determined by the amount of interprocessor communication performed, which in turn depends on the nonzero structure of the inp... 详细信息
来源: 评论
Simple parallel and Distributed algorithms for Spectral Graph Sparsification  14
Simple Parallel and Distributed Algorithms for Spectral Grap...
收藏 引用
26th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Koutis, Ioannis Univ Puerto Rico Rio Piedras Comp Sci Dept San Juan PR 00925 USA
We describe a simple algorithm for spectral graph sparsification, based on iterative computations of weighted spanners and uniform sampling. Leveraging the algorithms of Baswana and Sen for computing spanners, we obta... 详细信息
来源: 评论
Lopsidependency in the Moser-Tardos framework: Beyond the Lopsided Lovasz Local Lemma  15
Lopsidependency in the Moser-Tardos framework: Beyond the Lo...
收藏 引用
annual acm-Society for Industrial and Applied Mathmatics symposium on Discrete algorithms
作者: David G. Harris Department of Applied Mathematics University of Maryland
The Lopsided Lovasz Local Lemma (LLLL) is a powerful probabilistic principle which has been used in a variety of combinatorial constructions. While this principle began as a general statement about probability spaces,... 详细信息
来源: 评论