咨询与建议

限定检索结果

文献类型

  • 1,504 篇 会议
  • 105 篇 期刊文献

馆藏范围

  • 1,609 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,168 篇 工学
    • 1,111 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 579 篇 理学
    • 557 篇 数学
    • 55 篇 统计学(可授理学、...
    • 16 篇 物理学
    • 9 篇 生物学
    • 9 篇 系统科学
    • 8 篇 化学
  • 73 篇 管理学
    • 64 篇 管理科学与工程(可...
    • 40 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 16 篇 农学
    • 16 篇 作物学
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 3 篇 法学
    • 3 篇 社会学
  • 3 篇 教育学
    • 3 篇 教育学
  • 2 篇 医学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 237 篇 parallel algorit...
  • 173 篇 parallel process...
  • 80 篇 computer archite...
  • 74 篇 parallel process...
  • 57 篇 parallel program...
  • 55 篇 algorithms
  • 47 篇 parallel archite...
  • 41 篇 hardware
  • 30 篇 scheduling
  • 27 篇 computer program...
  • 21 篇 graph algorithms
  • 20 篇 computer systems...
  • 18 篇 approximation al...
  • 18 篇 processor schedu...
  • 18 篇 computational mo...
  • 18 篇 field programmab...
  • 17 篇 parallel computi...
  • 16 篇 computer science
  • 16 篇 performance
  • 16 篇 delay

机构

  • 32 篇 carnegie mellon ...
  • 15 篇 swiss fed inst t...
  • 15 篇 carnegie mellon ...
  • 11 篇 univ maryland de...
  • 11 篇 stanford univ st...
  • 10 篇 univ maryland co...
  • 10 篇 mit 77 massachus...
  • 10 篇 univ calif berke...
  • 8 篇 eth zurich
  • 7 篇 georgetown univ ...
  • 7 篇 mit cambridge ma...
  • 7 篇 univ texas austi...
  • 6 篇 penn state univ ...
  • 6 篇 mit csail cambri...
  • 5 篇 univ calif river...
  • 5 篇 princeton univer...
  • 5 篇 university of ma...
  • 5 篇 microsoft res re...
  • 5 篇 carnegie mellon ...
  • 5 篇 harvard univ cam...

作者

  • 38 篇 blelloch guy e.
  • 20 篇 gu yan
  • 18 篇 gibbons phillip ...
  • 18 篇 shun julian
  • 18 篇 goodrich michael...
  • 16 篇 fineman jeremy t...
  • 15 篇 sun yihan
  • 14 篇 dhulipala laxman
  • 13 篇 vishkin uzi
  • 12 篇 agrawal kunal
  • 11 篇 leiserson charle...
  • 10 篇 ballard grey
  • 10 篇 hoefler torsten
  • 10 篇 anon
  • 10 篇 miller gary l.
  • 10 篇 harris david g.
  • 9 篇 ghaffari mohsen
  • 9 篇 tangwongsan kana...
  • 9 篇 reif john h.
  • 9 篇 demmel james

语言

  • 1,569 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1609 条 记 录,以下是1361-1370 订阅
排序:
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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-... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
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... 详细信息
来源: 评论
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... 详细信息
来源: 评论
Large-scale sorting in parallel memories  91
Large-scale sorting in parallel memories
收藏 引用
Third annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Nodine, M.H. Vitter, J.S. Dept. of Computer Science Brown University Providence R. I.
We present several algorithms for sorting efficiently with parallel two-level and multilevel memories. Our main result is an elegant, easy-to-implement, optimal, deterministic algorithm for external sorting with P dis... 详细信息
来源: 评论