咨询与建议

限定检索结果

文献类型

  • 347 篇 会议
  • 18 篇 期刊文献

馆藏范围

  • 365 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 251 篇 工学
    • 248 篇 计算机科学与技术...
    • 165 篇 软件工程
    • 25 篇 电气工程
    • 23 篇 信息与通信工程
    • 17 篇 控制科学与工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 4 篇 生物工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 机械工程
    • 2 篇 化学工程与技术
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
  • 147 篇 理学
    • 143 篇 数学
    • 23 篇 统计学(可授理学、...
    • 4 篇 生物学
    • 3 篇 系统科学
    • 2 篇 化学
  • 13 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 6 篇 农学
    • 6 篇 作物学
    • 2 篇 农业资源与环境
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 82 篇 parallel algorit...
  • 68 篇 parallel process...
  • 12 篇 parallel program...
  • 11 篇 computer program...
  • 9 篇 scheduling
  • 7 篇 computer archite...
  • 7 篇 pram
  • 6 篇 computer systems...
  • 5 篇 graph algorithms
  • 4 篇 performance
  • 4 篇 parallel archite...
  • 4 篇 multithreading
  • 4 篇 transactional me...
  • 4 篇 work stealing
  • 3 篇 parallel process...
  • 3 篇 parallelism
  • 3 篇 approximation al...
  • 3 篇 cilk
  • 3 篇 sorting
  • 3 篇 chip multiproces...

机构

  • 10 篇 carnegie mellon ...
  • 4 篇 carnegie mellon ...
  • 4 篇 univ of paderbor...
  • 3 篇 department of co...
  • 3 篇 university of ma...
  • 3 篇 mit 77 massachus...
  • 2 篇 duke univ durham...
  • 2 篇 univ calif river...
  • 2 篇 carnegie mellon ...
  • 2 篇 univ of toronto ...
  • 2 篇 dept. of compute...
  • 2 篇 at and t bell la...
  • 2 篇 sandia national ...
  • 2 篇 computer science...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...
  • 2 篇 bell laboratorie...

作者

  • 12 篇 gibbons phillip ...
  • 11 篇 blelloch guy e.
  • 6 篇 reif john h.
  • 6 篇 leiserson charle...
  • 5 篇 matias yossi
  • 4 篇 uzi vishkin
  • 4 篇 ramachandran vij...
  • 4 篇 vitter jeffrey s...
  • 4 篇 muthukrishnan s.
  • 4 篇 goodrich michael...
  • 4 篇 phillip b. gibbo...
  • 3 篇 snir marc
  • 3 篇 cormen thomas h.
  • 3 篇 deng xiaotie
  • 3 篇 tangwongsan kana...
  • 3 篇 sohn andrew
  • 3 篇 leighton tom
  • 3 篇 simhadri harsha ...
  • 3 篇 miller gary l.
  • 3 篇 gu yan

语言

  • 352 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures"
365 条 记 录,以下是251-260 订阅
排序:
Optimal weighted loop fusion for parallel programs  97
Optimal weighted loop fusion for parallel programs
收藏 引用
proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Megiddo, Nimrod Sarkar, Vivek IBM Almaden Research Cent CA San Jose United States
Much of the computation involved in parallel programs occurs within loops, either nested loops as in parallel scientific applications or collections of loops as in stream-based applications. Loop fusion is a well-know... 详细信息
来源: 评论
Interprocessor communication speed and performance in distributed-memory parallel processors.  89
Interprocessor communication speed and performance in distri...
收藏 引用
16th annual International symposium on Computer Architecture
作者: Annaratone, Marco Pommerell, Claude Ruhl, Roland Swiss Fed Inst of Technology Zurich Switz
The authors have simulated several numerical and nonnumerical algorithms on five distributed-memory parallel processors (DMPPs). All five DMPPs have the same topology (a torus) and the same number of nodes. The archit... 详细信息
来源: 评论
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... 详细信息
来源: 评论
parallel and output sensitive algorithms for combinatorial and linear algebra problems  93
Parallel and output sensitive algorithms for combinatorial a...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Cheriyan, Joseph Reif, John H. Department of Combinatorics and Optimization University of Waterloo ONN2L 3G1 Canada Department of Computer Science Duke University DurhamNC27706 United States
The notion of output sensitive parallel algorithms for linear algebra problems is formalized in this paper, and such algorithms are presented for finding the rank of an n x n matrix in randomized parallel time 0(log n... 详细信息
来源: 评论
Portable parallel programs using architecture-aware libraries  12
Portable parallel programs using architecture-aware librarie...
收藏 引用
27th annual acm symposium on Applied Computing, SAC 2012
作者: Zaraket, Fadi Noureddine, Mohamad Sabra, Mohamed Jaber, Ameen American University of Beirut Lebanon
Programs written for an architecture with n processors require a re-write when migrated to an m processor architecture {(m > n)} to benefit from additional resources. Compiler based solutions do not match manual op... 详细信息
来源: 评论
parallel construction and query of suffix trees for two-dimensional matrices  93
Parallel construction and query of suffix trees for two-dime...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Giancarlo, Raffaele Grossi, Roberto AT and T Bell Laboratories Murray HillNJ07974 United States University of Palermo Italy Dipartimento di Informatica Università di Pisa Pisa56125 Italy Dipartimento di Sistemi e Informatica Università di Firenze Firenze50134 Italy
We give efficient CRCW PRAM algorithms for the construction of two data structures, the Lsuffix Tree of a square matrix and the Nested Suffix Tree of a general matrix. The Lsuffix tree, introduced by Giancarlo [11], r... 详细信息
来源: 评论
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)  94
Dynamic load balancing in parallel and distributed networks ...
收藏 引用
6th annual acm symposium on parallel algorithms and architectures, SPAA 1994
作者: Ghosh, Bhaskar Muthukrishnan, S. Department of Computer Science Yale University P.O. Box 208285 New HavenCT06520 United States Courant Institute of Mathematical Sciences New York University 251 Mercer Street New YorkNY10012-1185 United States
The fundamental problems in dynamic load balancing and job scheduling in parallel and distributed computers involve moving load between processors. In this paper, we consider a new model for load movement in synchrono... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Highly efficient dictionary matching in parallel  93
Highly efficient dictionary matching in parallel
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Muthukrishnan, S. Palem, K. Courant Institute of Mathematical Sciences 251 Mercer Street New YorkNY10012-1185 United States IBM Research Division T. J. Watson Research Center P. O. Box 704 Yorktown HeightsNY10598 United States
We present highly efficient parallel algorithms for several well-studied dictionary matching problems. Our algorithms are faster and more efficient in terms of their parallel work, compared to previously known results... 详细信息
来源: 评论
Optimal parallel suffix-prefix matching algorithm and applications  89
Optimal parallel suffix-prefix matching algorithm and applic...
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Kedera, Zvi M. Landau, Gad M. Palem, Krishna V. Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer St. New YorkNY United States Computer Science Division Polytechnic Univ. 333 Jay St. Brooklyn New YorkNY11201 United States IBM Research Division P. O. Box 704 Yorktown HeightsNY10598 United States
Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal speedup on a CRCW PRAM. It runs in time O(logn) using n/log n processors. This algorithm is important because we utihze... 详细信息
来源: 评论