咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是361-370 订阅
排序:
parallel balanced allocations  96
Parallel balanced allocations
收藏 引用
Proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Stemann, Volker Int Computer Science Inst Berkeley CA United States
We study the well known problem of throwing m balls into n bins. If each ball in the sequential game is allowed to select more than one bin, the maximum load of the bins can be exponentially reduced compared to the `c... 详细信息
来源: 评论
A Simple and Practical Linear-Work parallel Algorithm for Connectivity  14
A Simple and Practical Linear-Work Parallel Algorithm for Co...
收藏 引用
26th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Shun, Julian Dhulipala, Laxman Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA
Graph connectivity is a fundamental problem in computer science with many important applications. Sequentially, connectivity can be done in linear work easily using breadth-first search or depth-first search. There ha... 详细信息
来源: 评论
Brief Announcement: parallel Transitive Closure Within 3D Crosspoint Memory  18
Brief Announcement: Parallel Transitive Closure Within 3D Cr...
收藏 引用
30th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Velasquez, Alvaro Jha, Sumit Kumar Univ Cent Florida Dept Comp Sci Orlando FL 32816 USA
The infamous memory-processor bottleneck has motivated the search for logic-in-memory architectures. In this paper, we demonstrate how the transitive closure problem can be solved through in-memory computing within a ... 详细信息
来源: 评论
Proximity-Aware Directory-based Coherence for Multi-core Processor architectures  07
Proximity-Aware Directory-based Coherence for Multi-core Pro...
收藏 引用
19th annual symposium on parallelism in algorithms and architectures
作者: Brown, Jeffery A. Kumar, Rakesh Tullsen, Dean Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA
As the number of cores increases on chip multiprocessors, coherence is fast becoming a central issue for multi-core performance. This is exacerbated by the fact that interconnection speeds are not scaling well with te... 详细信息
来源: 评论
Online algorithms for prefetching and caching on parallel disks  04
Online algorithms for prefetching and caching on parallel di...
收藏 引用
SPAA 2004 - Sixteenth annual acm symposium on parallelism in algorithms and architectures
作者: Shah, Rahul Varman, Peter J. Vitter, Jeffrey Scott Dept. of Computer Sciences Purdue University West Lafayette IN 47907 United States Dept. of ECE Rice University Houston TX 77005 United States
parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as possible, using prefetching to avoid bottle... 详细信息
来源: 评论
parallelizing Dynamic Information Flow Tracking  08
Parallelizing Dynamic Information Flow Tracking
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Ruwase, Olatunji Gibbons, Phillip B. Mowry, Todd C. Ramachandran, Vijaya Chen, Shimin Kozuch, Michael Ryan, Michael Carnegie Mellon Univ Pittsburgh PA 15213 USA
Dynamic information flow tracking (DIFT) is an important tool for detecting common security attacks and memory bugs. A DIFT tool tracks the flow of information through a monitored program's registers and memory lo... 详细信息
来源: 评论
Adaptive Massively parallel Connectivity in Optimal Space  23
Adaptive Massively Parallel Connectivity in Optimal Space
收藏 引用
35th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Latypov, Rustam Lacki, Jakub Maus, Yannic Uitto, Jara Aalto Univ Espoo Finland Google Res New York NY USA Graz Univ Technol Graz Austria
We study the problem of finding connected components in the Adaptive Massively parallel Computation (AMPC) model. We show that when we require the total space to be linear in the size of the input graph the problem ca... 详细信息
来源: 评论
parallel Peeling algorithms  14
Parallel Peeling Algorithms
收藏 引用
26th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Jiang, Jiayang Mitzenmacher, Michael Thaler, Justin Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA Univ Calif Berkeley Simons Inst Theory Comp Berkeley CA USA
The analysis of several algorithms and data structures can be framed as a peeling process on a random hypergraph: vertices with degree less than k are removed until there are no vertices of degree less than k left. Th... 详细信息
来源: 评论
Latency-hiding work stealing: Scheduling interacting parallel computations with work stealing  16
Latency-hiding work stealing: Scheduling interacting paralle...
收藏 引用
28th acm symposium on parallelism in algorithms and architectures, SPAA 2016
作者: Muller, Stefan K. Acar, Umut A. Carnegie Mellon University PittsburghPA United States
With the rise of multicore computers, parallel applications no longer consist solely of computational, batch workloads, but also include applications that may, for example, take input from a user, access secondary sto... 详细信息
来源: 评论
parallel Streaming Frequency-Based Aggregates  14
Parallel Streaming Frequency-Based Aggregates
收藏 引用
26th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Tangwongsan, Kanat Tirthapura, Srikanta Wu, Kun-Lung Mahidol Univ Int Coll Comp Sci Program Bangkok Thailand Iowa State Univ Dept Elect & Comp Engn Ames IA USA IBM TJ Watson Res Ctr Yorktown Hts NY USA
We present efficient parallel streaming algorithms for fundamental frequency-based aggregates in both the sliding window and the infinite window settings. In the sliding window setting, we give a parallel algorithm fo... 详细信息
来源: 评论