咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是91-100 订阅
排序:
Sparse parallel Delaunay Mesh Refinement  07
Sparse Parallel Delaunay Mesh Refinement
收藏 引用
19th annual symposium on parallelism in algorithms and architectures
作者: Hudson, Benoit Miller, Gary L. Phillips, Todd Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA
The authors recently introduced the technique of sparse mesh refinement to produce the first near-optimal sequential time bounds of O(n lg L/s+m) for inputs in any fixed dimension with piecewise-linear constraining (P... 详细信息
来源: 评论
Analysis of first-come-first-serve parallel job scheduling
Analysis of first-come-first-serve parallel job scheduling
收藏 引用
proceedings of the 1998 9th annual acm SIAM symposium on Discrete algorithms
作者: Schwiegelshohn, Uwe Yahyapour, Ramin Univ Dortmund Dortmund Germany
This paper analyzes job scheduling for parallel computers by using theoretical and experimental means. Based on existing architectures we first present a machine and a job model. Then, we propose a simple on-line algo... 详细信息
来源: 评论
Deterministic and Low-Span Work-Efficient parallel Batch-Dynamic Trees  24
Deterministic and Low-Span Work-Efficient Parallel Batch-Dyn...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Anderson, Daniel Blelloch, Guy E. Carnegie Mellon Univ Pittsburgh PA 15213 USA
Dynamic trees are a well-studied and fundamental building block of dynamic graph algorithms dating back to the seminal work of Sleator and Tarjan [STOC'81, (1981), pp. 114-122]. The problem is to maintain a tree s... 详细信息
来源: 评论
On the analysis of randomized load balancing schemes  97
On the analysis of randomized load balancing schemes
收藏 引用
proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Mitzenmacher, Michael Digital Systems Research Cent Palo Alto CA United States
It is well known that simple randomized load balancing schemes can balance load effectively while incurring only a small overhead, making such schemes appealing for practical systems. In this paper, we provide new ana... 详细信息
来源: 评论
LogGP: incorporating long messages into the LogP model - one step closer towards a realistic model for parallel computation
LogGP: incorporating long messages into the LogP model - one...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Alexandrov, Albert Ionescu, Mihai F. Schauser, Klaus E. Scheiman, Chris Univ of California Santa Barbara United States
The original LogP model for parallel computation use four parameters;the communication latency (L), overhead (n), bandwidth (g), and the number of processors (P). This basic model is extended with a linear model for l... 详细信息
来源: 评论
SPAA 2005 - Seventeenth annual acm symposium on parallelism in algorithms and architectures
SPAA 2005 - Seventeenth Annual ACM Symposium on Parallelism ...
收藏 引用
Seventeenth annual acm symposium on parallelism in algorithms and architectures
The proceedings contain 39 papers. The topics discussed include: randomized queue management for DiffServ;randomization does not reduce the average delay in parallel packet switches;dynamic circular work-stealing dequ... 详细信息
来源: 评论
A Framework for parallelizing Approximate Gaussian Elimination  24
A Framework for Parallelizing Approximate Gaussian Eliminati...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Baumann, Yves Kyng, Rasmus Swiss Fed Inst Technol Zurich Switzerland
In a breakthrough result, Spielman and Teng (2004) developed a nearly-linear time solver for Laplacian linear equations, i.e. equations where the coefficient matrix is symmetric with non-negative diagonals and zero ro... 详细信息
来源: 评论
Efficient external memory algorithms by simulating coarse-grained parallel algorithms  97
Efficient external memory algorithms by simulating coarse-gr...
收藏 引用
proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Dehne, Frank Dittrich, Wolfgang Hutchinson, David Carleton Univ Ottawa Ont Canada
External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. For certain large scale applications this ... 详细信息
来源: 评论
Provably efficient scheduling for languages with fine-grained parallelism  95
Provably efficient scheduling for languages with fine-graine...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Blelloch, Guy E. Gibbons, Phillip B. Matias, Yossi Carnegie Mellon Univ Pittsburgh PA United States
Most high-level parallel programming languages allow for fine-grained parallelism. Programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to ... 详细信息
来源: 评论
Deterministic sorting and randomized median finding on the BSP model  96
Deterministic sorting and randomized median finding on the B...
收藏 引用
proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Gerbessiotis, Alexandros V. Siniolakis, Constantinos J. Oxford Univ Oxford United Kingdom
We present new BSP algorithms for deterministic sorting and randomized median finding. We sort n general keys by using a partitioning scheme that achieves the requirements of efficiency (one-optimality) and insensitiv... 详细信息
来源: 评论