咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是131-140 订阅
排序:
Bounds on the efficiency of message-passing protocols for parallel computers  93
Bounds on the efficiency of message-passing protocols for pa...
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Cypher, Robert Konstantinidou, Smaragda IBM Almaden Research Center San Jose CA
This paper considers the problem of creating message-passing protocols for parallel computers. It is assumed that the processors are connected by a network that provides guaranteed delivery of every message, provided ... 详细信息
来源: 评论
SuperMatrix Out-of-Order Scheduling of Matrix Operations for SMP and Multi-Core architectures  07
SuperMatrix Out-of-Order Scheduling of Matrix Operations for...
收藏 引用
19th annual symposium on parallelism in algorithms and architectures
作者: Chan, Ernie Quintana-Orti, Enrique S. Quintana-Orti, Gregorio van de Geijn, Robert Univ Texas Austin Dept Comp Sci Austin TX 78712 USA Univ Jaume 1 Dept Ingn & Ciencia Computad Castellon de La Plana Spain
We discuss the high-performance parallel implementation and execution of dense linear algebra matrix operations on SMP architectures;with an eye towards multi-core processors with many cores. We argue that traditional... 详细信息
来源: 评论
DREADLOCKS: Efficient Deadlock Detection  08
DREADLOCKS: Efficient Deadlock Detection
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Koskinen, Eric Herlihy, Maurice Brown Univ Dept Comp Sci Providence RI 02912 USA
We present Dreadlocks. an efficient new shared-memory spin lock that actively detects deadlocks. Instead of spinning on a Boolean value, each thread spins on the lock owner's per-thread digest, a compact represent... 详细信息
来源: 评论
Optimal trade-offs between size and slowdown for universal parallel networks
Optimal trade-offs between size and slowdown for universal p...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Meyer auf der Heide, Friedhelm Storch, Martin Wanka, Rolf Univ of Paderborn Paderborn Germany
In this paper, we address the question how efficiently a single constant-degree processor network can simulate the computation of any constant-degree processor network. We show the following lower bound trade-off: If ... 详细信息
来源: 评论
SPAA'11 - proceedings of the 23rd annual symposium on parallelism in algorithms and architectures
SPAA'11 - Proceedings of the 23rd Annual Symposium on Parall...
收藏 引用
23rd acm symposium on parallelism in algorithms and architectures, SPAA'11
The proceedings contain 50 papers. The topics discussed include: graph expansion and communication costs of fast matrix multiplication;near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch...
来源: 评论
Conflict-free access of arrays in a parallel processor  89
Conflict-free access of arrays in a parallel processor
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Lee, D.-L. Wang, Y.H. Department of Computer Science York University North YorkONM3J1P3 Canada
Let T be a collection of data templates of an N × N matrix, T = {row, column, forward diagonal, backward diagonal}. In the context of parallel processing, the question of whether it is possible or not for a paral... 详细信息
来源: 评论
parallelism in Dynamic Well-Spaced Point Sets  11
Parallelism in Dynamic Well-Spaced Point Sets
收藏 引用
23rd annual symposium on parallelism in algorithms and architectures
作者: Acar, Umut A. Cotter, Andrew Hudson, Benoit Tuerkoglu, Duru Max Planck Inst Software Syst Kaiserslautern Germany
parallel algorithms and dynamic algorithms possess an interesting duality property: compared to sequential algorithms, parallel algorithms improve run-time while preserving work, while dynamic algorithms improve work ... 详细信息
来源: 评论
Efficient automatic simulation of parallel computation on networks of workstations
收藏 引用
DISCRETE APPLIED MATHEMATICS 2006年 第10期154卷 1500-1509页
作者: Kaklamanis, Christos Krizanc, Danny Montangero, Manuela Persiano, Giuseppe Univ Modena & Reggio Emilia Dipartimento Ingn Informaz I-41100 Modena Italy Univ Patras Inst Comp Technol GR-26500 Patras Greece Univ Patras Dept Comp Engn & Informat GR-26500 Patras Greece Wesleyan Univ Dept Math & Comp Sci Middletown CT 06459 USA Univ Salerno Dipartimento Informat & Applicaz I-84081 Baronissi Italy
Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: proceedings of the acm symposium on Theory of Computing, 1996, pp. 257-265;Improved methods for hiding latency in high bandwidth netw... 详细信息
来源: 评论
Space-efficient representations of shared data for parallel computers  90
Space-efficient representations of shared data for parallel ...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Herley, Kieran T. Cornell Univ Itaca NY United States
The problem of representing a set U = {u1, ..., um} of read-write variables on an n-node distributed memory parallel computer is considered. It is shown that U can be represented among the n nodes of a variant of the ... 详细信息
来源: 评论
Fast parallel matching in expander graphs  93
Fast parallel matching in expander graphs
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Kelson, Pierre Univ. of British Columbia Vancouver B.C. Canada
Let iT be a bipartite graph with bipartition (A, B) where \A\-n and every subset X of A with at most a n elements has at least b\X\ neighbors (o 1). We consider the problem of computing a matching from a given subset... 详细信息
来源: 评论