咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
Improved Worst -Case Deterministic parallel Dynamic Minimum Spanning Forest  18
Improved Worst -Case Deterministic Parallel Dynamic Minimum ...
收藏 引用
30th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Kopelowitz, Tsvi Porat, Ely Rosenmutter, Yair Bar Ilan Univ Ramat Gan Israel
This paper gives a new deterministic algorithm for the dynamic Minimum Spanning Forest (MSF) problem in the EREW PRAM model, where the goal is to maintain a MSF of a weighted graph with n vertices and m edges while su... 详细信息
来源: 评论
Brief Announcement: Open Cilk  18
Brief Announcement: Open Cilk
收藏 引用
30th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Schardl, Tao B. Lee, I-Ting Angelina Leiserson, Charles E. MIT CSAIL Cambridge MA 02139 USA Washington Univ St Louis MO 63110 USA
Open Cilk is a new open-source platform to support Cilk multi-threaded programming, especially for researchers and teachers. Open Cilk aims to provide a full-featured implementation of Cilk that is easy to modify and ... 详细信息
来源: 评论
A Simple and Efficient parallel Laplacian Solver  23
A Simple and Efficient Parallel Laplacian Solver
收藏 引用
35th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Sachdeva, Sushant Zhao, Yibin Univ Toronto Toronto ON Canada
A symmetric matrix is called a Laplacian if it has nonpositive off-diagonal entries and zero row sums. Since the seminal work of Spielman and Teng (2004) on solving Laplacian linear systems in nearly linear time, seve... 详细信息
来源: 评论
Scheduling Irregular parallel Computations on Hierarchical Caches  11
Scheduling Irregular Parallel Computations on Hierarchical C...
收藏 引用
23rd annual symposium on parallelism in algorithms and architectures
作者: Blelloch, Guy E. Fineman, Jeremy T. Gibbons, Phillip B. Simhadri, Harsha Vardhan Carnegie Mellon Univ Pittsburgh PA 15213 USA
For nested-parallel computations with low depth (span, critical path length) analyzing the work, depth, and sequential cache complexity suffices to attain reasonably strong bounds on the parallel runtime and cache com... 详细信息
来源: 评论
Brief announcement: RedRem: A parallel redundancy remover  11
Brief announcement: RedRem: A parallel redundancy remover
收藏 引用
Proceedings of the twenty-third annual acm symposium on parallelism in algorithms and architectures
作者: Acharya, Hrishikesh Gouda, Mohamed University of Texas at Austin Austin TX United States National Science Foundation Washington DC United States
Policies defined by a sequence of predicate-decision rules, with first-match semantics, are widely used;a notable example is their use in firewalls, where the rules are used to decide whether to accept or discard each... 详细信息
来源: 评论
Bandwidth Optimized parallel algorithms for Sparse Matrix-Matrix Multiplication using Propagation Blocking  20
Bandwidth Optimized Parallel Algorithms for Sparse Matrix-Ma...
收藏 引用
32nd acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Gu, Zhixiang Moreira, Jose Edelsohn, David Azad, Ariful Indiana Univ Bloomington IN 47405 USA IBM Corp Armonk NY 10504 USA Facebook Inc Menlo Pk CA 94025 USA
Sparse matrix-matrix multiplication (SpGEMM) is a widely used kernel in various graph, scientific computing and machine learning algorithms. It is well known that SpGEMM is a memory-bound operation, and its peak perfo... 详细信息
来源: 评论
Field-Split parallel Architecture for High Performance Multi-Match Packet Classification Using FPGAs  09
Field-Split Parallel Architecture for High Performance Multi...
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Jiang, Weirong Prasanna, Viktor K. Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA
Multi-match packet classification is a critical function in network intrusion detection systems (NIDS), where all matching rules for a packet need to be reported. Most of the previous work is based on ternary content ... 详细信息
来源: 评论
Space-efficient scheduling of parallelism with synchronization variables  97
Space-efficient scheduling of parallelism with synchronizati...
收藏 引用
Proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Blelloch, Guy E. Gibbons, Phillip B. Matias, Yossi Narlikar, Girija J. Carnegie Mellon Pittsburgh PA United States
Recent work on scheduling algorithms has resulted in provable bounds on the space taken by parallel computations in relation to the space taken by sequential computations. The results for online versions of these algo... 详细信息
来源: 评论
Communication-optimal parallel minimum spanning tree algorithms extended abstract
Communication-optimal parallel minimum spanning tree algorit...
收藏 引用
Proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Adler, M. Dittrich, W. Juurlink, B. Kutylowski, M. Rieping, I. Univ of Toronto Toronto Ont Canada
Lower and upper bounds for finding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented. We provide the first non-trivial lower bounds on the communication volume required to sol... 详细信息
来源: 评论
Massively parallel algorithms for b-Matching*  22
Massively Parallel Algorithms for b-Matching*
收藏 引用
34th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Ghaffari, Mohsen Grunau, Christoph Mitrovic, Slobodan Swiss Fed Inst Technol Zurich Switzerland Univ Calif Davis Davis CA USA
This paper presents an O (log log (d) over bar) round massively parallel algorithm for 1 +epsilon approximation of maximum weighted b-matchings, using near-linear memory per machine. Here (d) over bar denotes the aver... 详细信息
来源: 评论