咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是501-510 订阅
排序:
Optimal parallel algorithms in the Binary-Forking Model  20
Optimal Parallel Algorithms in the Binary-Forking Model
收藏 引用
32nd acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Blelloch, Guy E. Fineman, Jeremy T. Gu, Yan Sun, Yihan Carnegie Mellon Univ Pittsburgh PA 15213 USA Georgetown Univ Washington DC 20057 USA Univ Calif Riverside Riverside CA 92521 USA
In this paper we develop optimal algorithms in the binary-forking model for a variety of fundamental problems, including sorting, semisorting, list ranking, tree contraction, range minima, and ordered set union, inter... 详细信息
来源: 评论
architectures and algorithms for millisecond-scale molecular dynamics simulations of proteins  41
Architectures and algorithms for millisecond-scale molecular...
收藏 引用
2008 - 41st annual IEEE/acm International symposium on Microarchitecture, MICRO-41
作者: Shaw, David E. Columbia's Medical School United States
The ability to perform long, accurate molecular dynamics (MD) simulations involving proteins and other biological macromolecules could in principle lead to important scientific advances and provide a powerful new tool... 详细信息
来源: 评论
Near Optimal parallel algorithms for Dynamic DFS in Undirected Graphs  17
Near Optimal Parallel Algorithms for Dynamic DFS in Undirect...
收藏 引用
29th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Khan, Shahbaz IIT Kanpur Dept CSE Kanpur 208016 Uttar Pradesh India
Depth first search (DFS) tree is a fundamental data structure for solving various graph problems. The classical algorithm [37] for building a DFS tree requires O(m + n) time for a given undirected graph G having n ver... 详细信息
来源: 评论
Provably Efficient Scheduling of Cache-oblivious Wavefront algorithms  17
Provably Efficient Scheduling of Cache-oblivious Wavefront A...
收藏 引用
29th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Chowdhury, Rezaul Ganapathi, Pramod Tang, Yuan Tithi, Jesmin Jahan SUNY Stony Brook Stony Brook NY 11790 USA Fudan Univ Shanghai Key Lab Intelligent Informat Proc State Key Lab Comp Arch ICT Sch Comp SciSch SoftwareCAS Shanghai Peoples R China Intel Corp Santa Clara CA USA
Iterative wavefront algorithms for evaluating dynamic programming recurrences exploit optimal parallelism but show poor cache performance. Tiled-iterative wavefront algorithms achieve optimal cache complexity and high... 详细信息
来源: 评论
Brief announcement: An implementation report for parallel triangular decompositions
Brief announcement: An implementation report for parallel tr...
收藏 引用
SPAA 2006: 18th annual acm symposium on parallelism in algorithms and architectures
作者: Maza, Marc Moreno Xie, Yuzhen London Ont. Canada
Since the discovery of Gröbner bases, the algorithmic advances in Commutative Algebra have made possible to tackle many classical problems in Algebraic Geometry that were previously out of reach. However, algorit... 详细信息
来源: 评论
A Novel Computational Model for GPUs with Application to I/O Optimal Sorting algorithms  28
A Novel Computational Model for GPUs with Application to I/O...
收藏 引用
28th IEEE International parallel & Distributed Processing symposium Workshops (IPDPSW)
作者: Koike, Atsushi Sadakane, Kunihiko Natl Inst Informat Principles Informat Res Div Tokyo Japan Grad Univ Adv Studies Dept Informat Tokyo Japan
We propose a novel computational model for GPU. Known parallel computational models such as the PRAM model are not appropriate for evaluating GPU algorithms. Our model, called AGPU, abstracts the essence of current GP... 详细信息
来源: 评论
Scheduling Strategies for Optimistic parallel Execution of Irregular Programs  08
Scheduling Strategies for Optimistic Parallel Execution of I...
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Kulkarni, Milind Carribault, Patrick Pingali, Keshav Ramanarayanan, Ganesh Walter, Bruce Bala, Kavita Chew, L. Paul Univ Texas Austin Austin TX 78712 USA Cornell Univ Ithaca NY USA
Recent application studies have shown that many irregular applications have a generalized data parallelism that manifests itself as iterative computations over worklists of different kinds. In general, there are compl... 详细信息
来源: 评论
parallel graph contraction  89
Parallel graph contraction
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Phillips, Cynthia A. Laboratory for Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States
This paper shows how n-node, e-edge graphs can be contracted in a manner similar to the parallel tree contraction algorithm due to Miller and Reif. We give an O((n + e)/lgn)-processor deterministic algorithm that cont... 详细信息
来源: 评论
parallel Approximate Undirected Shortest Paths via Low Hop Emulators  2020
Parallel Approximate Undirected Shortest Paths via Low Hop E...
收藏 引用
52nd annual acm SIGACT symposium on Theory of Computing (STOC)
作者: Andoni, Alexandr Stein, Clifford Zhong, Peilin Columbia Univ New York NY 10027 USA
We present a (1 + epsilon) -approximate parallel algorithm for computing shortest paths in undirected graphs, achieving poly(log n) depth and mpoly(log n) work for n-nodes m-edges graphs. Although sequential algorithm... 详细信息
来源: 评论
Bipartite Perfect Matching Is in Quasi-NC  16
Bipartite Perfect Matching Is in Quasi-NC
收藏 引用
48th annual acm SIGACT symposium on Theory of Computing (STOC)
作者: Fenner, Stephen Gurjar, Rohit Thierauf, Thomas Univ South Carolina Columbia SC 29208 USA Aalen Univ Aalen Germany
We show that the bipartite perfect matching problem is in quasi-NC2. That is, it has uniform circuits of quasi polynomial size n(O(log n)) and O(log(2) n) depth. Previously, only an exponential upper bound was known o... 详细信息
来源: 评论