咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是81-90 订阅
排序:
SPAA 2021 - proceedings of the 33rd acm symposium on parallelism in algorithms and architectures
SPAA 2021 - Proceedings of the 33rd ACM Symposium on Paralle...
收藏 引用
33rd acm symposium on parallelism in algorithms and architectures, SPAA 2021
The proceedings contain 49 papers. The topics discussed include: fast stencil computations using fast Fourier transforms;low-span parallel algorithms for the binary-forking model;provable advantages for graph algorith...
来源: 评论
Better trade-offs for parallel list ranking  97
Better trade-offs for parallel list ranking
收藏 引用
proceedings of the 1997 9th annual acm symposium on parallel algorithms and architectures, SPAA
作者: Sibeyn, Jop F. Max-Plank-Inst fuer Informatik Saarbruecken Germany
An earlier parallel list ranking algorithm performs well for problem sizes N that are extremely large in comparison to the number of PUs P. However, no existing algorithm gives good performance for reasonable loads. W... 详细信息
来源: 评论
New preconditioner for the parallel solution of positive definite Toeplitz systems
New preconditioner for the parallel solution of positive def...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Bini, Dario Di Benedetto, Fabio Univ di Pisa Pisa Italy
We introduce a new preconditioner for solving a symmetric Toeplitz system of equations by the conjugate gradient method. This choice leads to an algorithm which is particularly suitable for parallel computations and, ... 详细信息
来源: 评论
Generalized sweep methods for parallel computational geometry  90
Generalized sweep methods for parallel computational geometr...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Goodrich, Michael T. Ghouse, Mujtaba R. Bright, Jonathan Johns Hopkins Univ Baltimore MD United States
In this paper we give efficient parallel algorithms for a number of problems from computational geometry by using generalized versions of parallel plane sweeping. We illustrate our approach with a number of applicatio... 详细信息
来源: 评论
annual acm symposium on parallelism in algorithms and architectures
Annual ACM Symposium on Parallelism in Algorithms and Archit...
收藏 引用
31st acm symposium on parallelism in algorithms and architectures, SPAA 2019
The proceedings contain 45 papers. The topics discussed include: the price of clustering in bin-packing with applications to bin-packing with delays;faster matrix multiplication via sparse decomposition;NC algorithms ...
来源: 评论
On multiprocessor system scheduling  96
On multiprocessor system scheduling
收藏 引用
proceedings of the 1996 8th annual acm symposium on parallel algorithms and architectures
作者: Deng, Xiaotie Dymond, Patrick York Univ North York Ont Canada
The issue of effectiveness of private caches for processors were studied. Since time for all processors to access the shared memory simultaneously is usually much longer than the time for a processor to access its own... 详细信息
来源: 评论
Low Depth Cache-Oblivious algorithms  10
Low Depth Cache-Oblivious Algorithms
收藏 引用
22nd acm symposium on parallelism in algorithms and architectures
作者: Blelloch, Guy E. Gibbons, Phillip B. Simhadri, Harsha Vardhan Carnegie Mellon Univ Pittsburgh PA 15213 USA
In this paper we explore a simple and general approach for developing parallel algorithms that lead to good cache complexity on parallel machines with private or shared caches The approach is to design nested-parallel... 详细信息
来源: 评论
Computational bounds for fundamental problems on general-purpose parallel models  98
Computational bounds for fundamental problems on general-pur...
收藏 引用
proceedings of the 1998 10th annual acm symposium on parallel algorithms and architectures, SPAA
作者: MacKenzie, Ph.D. Ramachandran, V. Boise State Univ Boise ID United States
We present lower bounds for time needed to solve basic problems on three general-purpose models of parallel computation: the shared-memory models QSM and s-QSW, and the distributed-memory model, the BSP. For each of t... 详细信息
来源: 评论
An efficient parallel algorithm for computing a large independent set in planar graph  89
An efficient parallel algorithm for computing a large indepe...
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Chrobek, Maxek Naor, Joseph Department of Mathematics and Computer Science University of California RiversideCA92521 United States Department of Computer Science Stanford University StanfordCA94305-2140 United States
Let (G) denote the independence number of a graph G, that is the maximum number of pairwise independent vertices in G. We present a parallel algorithm that computes in a planar graph G = (V, E), an independent set I ⊂... 详细信息
来源: 评论
symposium on parallelism in algorithms and architectures, SPAA 2003: 15th annual symposium on parallelism in algorithms and architectures
Symposium on Parallelism in Algorithms and Architectures, SP...
收藏 引用
4th acm Federated Computing Research Conference, FCRC 2003
The proceedings contain 7 papers from the symposium on parallelism in algorithms and architectures, SPAA 2003: 15th annual symposium on parallelism in algorithms and architectures. The topics discussed include: a prac... 详细信息
来源: 评论