咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 259 篇 工学
    • 255 篇 计算机科学与技术...
    • 173 篇 软件工程
    • 25 篇 电气工程
    • 23 篇 信息与通信工程
    • 18 篇 控制科学与工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 3 篇 生物工程
    • 2 篇 机械工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 化学工程与技术
  • 156 篇 理学
    • 153 篇 数学
    • 25 篇 统计学(可授理学、...
    • 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
  • 8 篇 algorithms
  • 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

机构

  • 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 篇 ibm research div...
  • 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 ...

作者

  • 13 篇 gibbons phillip ...
  • 11 篇 blelloch guy e.
  • 7 篇 matias yossi
  • 6 篇 uzi vishkin
  • 6 篇 ramachandran vij...
  • 6 篇 reif john h.
  • 6 篇 leiserson charle...
  • 5 篇 goodrich michael...
  • 5 篇 phillip b. gibbo...
  • 4 篇 vijaya ramachand...
  • 4 篇 vitter jeffrey s...
  • 4 篇 muthukrishnan s.
  • 4 篇 yossi matias
  • 4 篇 vishkin uzi
  • 3 篇 snir marc
  • 3 篇 cormen thomas h.
  • 3 篇 deng xiaotie
  • 3 篇 tangwongsan kana...
  • 3 篇 sohn andrew
  • 3 篇 leighton tom

语言

  • 368 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the fifth annual ACM symposium on Parallel Algorithms and Architectures"
381 条 记 录,以下是361-370 订阅
排序:
An optimal parallel dictionary  89
An optimal parallel dictionary
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Dietzfelbinger, Martin Friedhelm Meyer auf der Heide Universität-GH Paderborn fachbereich 17 PaderbornD-4790 Germany
来源: 评论
Technologies for low latency interconnection switches  89
Technologies for low latency interconnection switches
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Knight, Thomas F. M.I.T. Artificial Intelligence Laboratory United States
This paper presents an engineering design for a low latency high bandwidth interconnection network which will form the switching substrate for a multi-model parallel processing system. The performance is enhanced with... 详细信息
来源: 评论
More practical PRAM model  1
More practical PRAM model
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Gibbons, Phillip B. Computer Science Division University of California BerkeleyCA94720 United States
This paper introduces the Asynchronous PRAM model of computation, a variant of the PRAM in which the processors run asynchronously and there is an explicit charge for synchronization. A family of asynchronous PRAM'... 详细信息
来源: 评论
Efficient parallel algorithms for path problems in directed graphs  89
Efficient parallel algorithms for path problems in directed ...
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Lucas, Joan M. Sackrowitz, Marian Gunsher Department of Computer Science Rutgers University New BrunswickNJ08903 United States
In this paper we describe a technique for finding efficient parallel algorithms for problems on directed graphs that involve checking the ezistence of certain kinds of paths in the graph. This technique provides effic... 详细信息
来源: 评论
Optimal parallel algorithms for transitive closure and point location in planar structures  89
Optimal parallel algorithms for transitive closure and point...
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Tamassia, Roberto Vitter, Jeffrey Scott Department of Computer Science Brown University ProvidenceRI02912-1910 United States
We present parallel algorithms for several graph and geometric problems, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and cons... 详细信息
来源: 评论
Intersecting line segments in parallel with an output-sensitive number of processors  89
Intersecting line segments in parallel with an output-sensit...
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Goodrich, Michael T. Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States
We give an efficient parallel algorithm for constructing the arrangement of n line segments in the plane, i.e., the planar graph 'determined by the segment endpoints and intersections. Our algorithm is efficient r... 详细信息
来源: 评论
The power of parallel pointer manipulation  89
The power of parallel pointer manipulation
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Lam, Tak Wah Ruzzo, Walter L. Department of Computer Science University of Hong Kong Pokfulam Road Hong Kong Computer Science Department University of Washington SeattleWA98195 United States
An HMM is a very simple parallel machine consisting of finite state devices that can manipulate pointers to each other. The more commonly studied PRAM is a much richer parallel machine with a shared global memory and ...
来源: 评论
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 ⊂... 详细信息
来源: 评论
parallel RAMs with bounded memory wordsize  89
Parallel RAMs with bounded memory wordsize
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Bellantoni, Stephen J. Department of Computer Science University of Toronto Canada
The PRAM model of parallel computation is examined with respect to wordsize, the number of bits which can be held in each global memory cell. First, adversary arguments are used to show the incomparability of certain ... 详细信息
来源: 评论
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... 详细信息
来源: 评论