咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 82 篇 parallel algorit...
  • 68 篇 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 of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...
  • 2 篇 bell laboratorie...

作者

  • 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

语言

  • 352 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures"
365 条 记 录,以下是311-320 订阅
排序:
In-place techniques for parallel convex hull algorithms  91
In-place techniques for parallel convex hull algorithms
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Ghouse, M. Goodrich, M. Dept. of Computer Science Johns Hopkins University Baltimore MD
来源: 评论
Simple load balancing scheme for task allocation in parallel machines
Simple load balancing scheme for task allocation in parallel...
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Rudolph, L. Slivkin-Allalouf, M. Upfal, E.
来源: 评论
Constructing arrangements optimally in parallel  91
Constructing arrangements optimally in parallel
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Goodrich, M.T. Department of Computer Science The Johns Hopkins University Baltimore MD
We give two optimal parallel algorithms for constructing the arrangement of n lines in the plane. The first method is quite simple and runs in O(log2n) time using O(n2) work, and the second method, which is more sophi... 详细信息
来源: 评论
parallel construction of trees with optimal weighted path length  91
Parallel construction of trees with optimal weighted path le...
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991
作者: Larmore, Lawrence L. Przytycka, Teresa M. Department of Computer Science University of California RiversideCA92521 United States Instytut Informatyki Uniwersytet Warszawski United States
This paper deals with the problem of parallel construction of trees with optimal weighted path length. We study both the unordered case, known as the Huffman coding problem and the ordered case known as the optimal al... 详细信息
来源: 评论
Fast and reliable parallel hashing  91
Fast and reliable parallel hashing
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Bast, H. Saarlands, U. Hagerup, T. Fachbereich Informatik Universität des Saarlandes W-6600 Saarbrücken Germany Max-Planck-Institut für Informatik W-6600 Saarbrücken Germany
A perfect hash function for a (multi)set X of n integers is an infective function h : X → {1,., s}, where s = O(n), that can be stored in O(n) space and evaluated in constant time by a single processor. We show that ... 详细信息
来源: 评论
More time-work tradeoffs for parallel graph algorithms  91
More time-work tradeoffs for parallel graph algorithms
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991
作者: Spencer, Thomas H. Computer Science Department Rensselaer Polytechnic Institute United States
Some parallel algorithms have the property that, as they are allowed to take more time, the total work that they do is reduced. This paper describes three such algorithms that find the strongly connected components of... 详细信息
来源: 评论
Processor efficient parallel solution of linear systems over an abstract field  91
Processor efficient parallel solution of linear systems over...
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Kaltofen, E. Pan, V. Department of Computer Science Rensselaer Polytechnic Institute Troy New York and Department of Computer Science University of Toronto Toronto Canada M5S 1A4 Department of Mathematics and Computer Science Lehman College City University of New York Bronx New York
parallel randomized algorithms are presented that solve n-dimensional systems of linear equations and compute inverses of n × n non-singular matrices over a field in O((log n)2) time, where each time unit represe... 详细信息
来源: 评论
parallel algorithms for routing in non-blocking networks  91
Parallel algorithms for routing in non-blocking networks
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991
作者: Lin, Geng Pippenger, Nicholas Department of Computer Science University of British Columbia VancouverBCV6T 1W5 Canada
Non-blocking networks have many applications in communications. Typical examples are telephone switching networks and communication networks among processors or between processors and memory devices. We construct non-... 详细信息
来源: 评论
A simple load balancing scheme for task allocation in parallel machines  91
A simple load balancing scheme for task allocation in parall...
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991
作者: Rudolph, Larry Slivkin-Allalouf, Miriam Upfal, Eli Department of Computer Science Hebrew University Jerusalem Israel IBM TJ Watson Research Center Yorktown HeightsNY United States John Bryce Ltd. Science Based Industries PO BOX 23838 Jerusalem Israel Department of Applied Mathematics Weizman Institute Rehovot Israel IBM Almaden Research Center San JoseCA United States
A collection of local workpiles (task queues) and a simple load balancing scheme is well suited for scheduling tasks in shared memory parallel machines. Task scheduling on such machines has usually been done through a... 详细信息
来源: 评论
In-place techniques for parallel convex hull algorithms  3
In-place techniques for parallel convex hull algorithms
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures, SPAA 1991
作者: Ghouse, Mujtaba R. Goodrich, Michael T. Dept. of Computer Science Johns Hopkins University BaltimoreMD21218-2686 United States
We present a number of efficient parallel algorithms for constructing 2- and 3-dimensional convex hulls on a randomized CRCW PRAM. Specifically, we show how to build the convex hull of n pre-sorted points in the plane... 详细信息
来源: 评论