咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Automatic Complexity Analysis of Explicitly parallel Programs  14
Automatic Complexity Analysis of Explicitly Parallel Program...
收藏 引用
26th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Hoefler, Torsten Kwasniewski, Grzegorz Swiss Fed Inst Technol Zurich Switzerland
The doubling of cores every two years requires programmers to expose maximum parallelism. Applications that are developed on today's machines will often be required to run on many more cores. Thus, it is necessary... 详细信息
来源: 评论
Improved sorting algorithms for parallel computers  87
Improved sorting algorithms for parallel computers
收藏 引用
15th annual Conference on Computer Science, CSC 1987
作者: Park, Arvin Balasubramanian, K. Department Computer Science Princeton University PrincetonNJ08544 United States
We make observations that improve processor utilization and decrease communication overhead for several parallel sorting algorithms. These lead to constant factor improvements on the best previous parallel sorting bou... 详细信息
来源: 评论
Asymptotically tight bounds for performing BMMC permutations on parallel disk systems  93
Asymptotically tight bounds for performing BMMC permutations...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Cormen, Thomas H. Wisniewski, Leonard F. Department of Mathematics and Computer Science Dartmouth College United States
We give asymptotically equal lower and upper bounds for the number of parallel I/O operations required to perform BMMC permutations (defined by a characteristic matrix that is nonsingular over GF{2)) on parallel disk ... 详细信息
来源: 评论
Analysis of multithreaded architectures for parallel computing  90
Analysis of multithreaded architectures for parallel computi...
收藏 引用
SPAA '90 - Proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Saavedra-Barrera, Rafel H. Culler, David E. von Eicken, Thorsten Univ of California Berkeley CA United States
Multithreading has been proposed as an architectural strategy for tolerating latency in multiprocessors and, through limited empirical studies, shown to offer promise. This paper develops an analytical model of multit... 详细信息
来源: 评论
On parallel k-Center Clustering  23
On Parallel k-Center Clustering
收藏 引用
35th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Coy, Sam Czumaj, Artur Mishra, Gopinath Univ Warwick Coventry W Midlands England
We consider the classic k-center problem in a parallel setting, on the low-local-space Massively parallel Computation (MPC) model, with local space per machine of O(n(delta)), where delta is an element of(0, 1) is an ... 详细信息
来源: 评论
Provably good and practically efficient parallel race detection for fork-join programs  16
Provably good and practically efficient parallel race detect...
收藏 引用
28th acm symposium on parallelism in algorithms and architectures, SPAA 2016
作者: Utterback, Robert Agrawal, Kunal Fineman, Jeremy T. Lee, I-Ting Angelina Washington University St. Louis United States Georgetown University United States
If a parallel program has determinacy race(s), different schedules can result in memory accesses that observe different values - various race-detection tools have been designed to find such bugs. A key component of ra... 详细信息
来源: 评论
Evaluating Graph Coloring on GPUs  11
Evaluating Graph Coloring on GPUs
收藏 引用
16th acm symposium on Principles and Practice of parallel Programming
作者: Grosset, A. V. Pascal Zhu, Peihong Liu, Shusen Venkatasubramanian, Suresh Hall, Mary Univ Utah Sch Comp Salt Lake City UT 84112 USA
This paper evaluates features of graph coloring algorithms implemented on graphics processing units (GPUs), comparing coloring heuristics and thread decompositions. As compared to prior work on graph coloring for othe... 详细信息
来源: 评论
Faster parallel Algorithm for Approximate Shortest Path  2020
Faster Parallel Algorithm for Approximate Shortest Path
收藏 引用
52nd annual acm SIGACT symposium on Theory of Computing (STOC)
作者: Li, Jason Carnegie Mellon Univ Pittsburgh PA 15213 USA
We present the firstm polylog(n) work, polylog(n) time algorithm in the PRAM model that computes (1 + epsilon)-approximate single-source shortest paths on weighted, undirected graphs. This improves upon the breakthrou... 详细信息
来源: 评论
Deterministic Massively parallel Connectivity*†  2022
Deterministic Massively Parallel Connectivity*†
收藏 引用
54th annual acm SIGACT symposium on Theory of Computing (STOC)
作者: Coy, Sam Czumaj, Artur Univ Warwick Coventry W Midlands England
We consider the problem of designing fundamental graph algorithms on the model of Massive parallel Computation (MPC). The input to the problem is an undirected graph G with n vertices and m edges, and with D being the... 详细信息
来源: 评论
Dynamic Graph algorithms with Batch Updates in the Massively parallel Computation Model  32
Dynamic Graph Algorithms with Batch Updates in the Massively...
收藏 引用
32nd annual acm-SIAM symposium on Discrete algorithms (SODA)
作者: Nowicki, Krzysztof Onak, Krzysztof Univ Wroclaw Wroclaw Poland IBM Res Hawthorne NY USA
We study dynamic graph algorithms in the Massively parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of ed... 详细信息
来源: 评论