咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 83 篇 parallel algorit...
  • 69 篇 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 maryland de...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...

作者

  • 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

语言

  • 353 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures"
366 条 记 录,以下是151-160 订阅
排序:
A Simpler and parallelizable O(√log n)-approximation Algorithm for SPARSEST CUT  24
A Simpler and Parallelizable O(√log n)-approximation Algori...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Kolmogorov, Vladimir Inst Sci & Technol Austria ISTA Klosterneuburg Austria
Currently, the best known tradeoff between approximation ratio and complexity for the Sparsest Cut problem is achieved by the algorithm in [Sherman, FOCS 2009]: it computes O(root(log n)/epsilon)-approximation using O... 详细信息
来源: 评论
Inherent Limitations on Disjoint-Access parallel Implementations of Transactional Memory (Preliminary Version)  09
Inherent Limitations on Disjoint-Access Parallel Implementat...
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Attiya, Hagit Hillel, Eshcar Milani, Alessia Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can be achieved by TM implementations. Two ... 详细信息
来源: 评论
Segment router: A novel router design for parallel computers  94
Segment router: A novel router design for parallel computers
收藏 引用
proceedings of the 6th annual acm symposium on parallel algorithms and architectures
作者: Konstantinidou, S. IBM T.J. Watson Research Center Yorktown Heights NY
In this paper we present the Segment router, a novel router design for the interconnection networks of massively parallel computers. The design decisions of the Segment router are motivated by the need to improve the ... 详细信息
来源: 评论
Checkpoints and Continuations Instead of Nested Transactions  08
Checkpoints and Continuations Instead of Nested Transactions
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Koskinen, Eric Herlihy, Maurice Brown Univ Dept Comp Sci Providence RI 02912 USA
We present a mechanism for partially aborting transactions through the use of data structure checkpoints and control-flow continuations. In particular, we show that boosted transactions [9] already have built-in resto... 详细信息
来源: 评论
Fault-Tolerant parallel Integer Multiplication  24
Fault-Tolerant Parallel Integer Multiplication
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Nissim, Roy Schwartz, Oded Spiizer, Yuval Hebrew Univ Jerusalem Dept Comp Sci Jerusalem Israel
Exascale machines have a small mean time between failures, necessitating fault tolerance. Out-of-the-box fault-tolerant solutions, such as checkpoint-restart and replication, apply to any algorithm but incur significa... 详细信息
来源: 评论
Efficient wiring of reconfigurable parallel processors  93
Efficient wiring of reconfigurable parallel processors
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Greenberg, David S. Sandia National Laboratories Mail Stop 1423 P.O. Box 5800 AlbuquerqueNM87185-5800 United States
Chips (or chip sets) which include one or more CPUs, some local memory, and rudimentary communications and routing hardware are becoming common (eg. transputers, SRCs HNet, the nodes of most MIMD machines). These chip... 详细信息
来源: 评论
Randomized parallel algorithm for planar graph isomorphism
Randomized parallel algorithm for planar graph isomorphism
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Gazit, Hillel Reif, John H. Duke Univ Durham United States
We present a parallel randomized algorithm for finding if two planar graphs are isomorphic. Assuming that we have a tree of separators for each planar graph, our algorithm takes O(log(n)) time with P = (n1.5&middo... 详细信息
来源: 评论
An overview of cray research computers including the Y-MP/C90 and the new MPP T3D  93
An overview of cray research computers including the Y-MP/C9...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Oed, Wilfried Walker, Martin Cray Research GmbH Riesstrasse 25 München SO8000 Germany Cray Research Inc. 655 Lone Oak Drive EaganMN55121 United States
The primary purpose of Cray Research computer systems is the timely solution of complex problems in science and engineering. A few examples illustrate that the CRAY C90 is currently the world's most powerful tool ... 详细信息
来源: 评论
Simple randomized mergesort on parallel disks  96
Simple randomized mergesort on parallel disks
收藏 引用
proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Barve, Rakesh D. Grove, Edward F. Vitter, Jeffrey Scott Duke Univ Durham NC United States
We consider the problem of sorting a file of N records on the D-disk model of parallel I/O [VS94] in which there are two sources of parallelism. Records are transferred to and from disk concurrently in blocks of B con... 详细信息
来源: 评论
annual acm symposium on parallelism in algorithms and architectures
Annual ACM Symposium on Parallelism in Algorithms and Archit...
收藏 引用
25th acm symposium on parallelism in algorithms and architectures, SPAA 2013
The proceedings contain 39 papers. The topics discussed include: Fast greedy algorithms in MapReduce and streaming;reduced hardware transactions: a new approach to hybrid transactional memory;recursive design of hardw...
来源: 评论