咨询与建议

限定检索结果

文献类型

  • 416 篇 会议
  • 20 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 306 篇 工学
    • 299 篇 计算机科学与技术...
    • 192 篇 软件工程
    • 31 篇 电气工程
    • 27 篇 信息与通信工程
    • 20 篇 控制科学与工程
    • 9 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 4 篇 生物医学工程(可授...
    • 4 篇 生物工程
    • 3 篇 机械工程
    • 3 篇 光学工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 化学工程与技术
    • 1 篇 环境科学与工程(可...
  • 172 篇 理学
    • 165 篇 数学
    • 25 篇 统计学(可授理学、...
    • 4 篇 生物学
    • 3 篇 物理学
    • 3 篇 系统科学
    • 1 篇 化学
  • 16 篇 管理学
    • 13 篇 管理科学与工程(可...
    • 11 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 6 篇 农学
    • 6 篇 作物学
    • 2 篇 农业资源与环境
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 92 篇 parallel algorit...
  • 81 篇 parallel process...
  • 14 篇 parallel program...
  • 13 篇 computer program...
  • 10 篇 computer archite...
  • 10 篇 scheduling
  • 8 篇 computer systems...
  • 8 篇 pram
  • 7 篇 parallel process...
  • 6 篇 parallel archite...
  • 5 篇 graph algorithms
  • 5 篇 multithreading
  • 4 篇 performance
  • 4 篇 approximation al...
  • 4 篇 computational ge...
  • 4 篇 bandwidth
  • 4 篇 processor schedu...
  • 4 篇 pipeline process...
  • 4 篇 transactional me...
  • 4 篇 concurrency

机构

  • 11 篇 carnegie mellon ...
  • 4 篇 univ maryland de...
  • 4 篇 carnegie mellon ...
  • 4 篇 univ of paderbor...
  • 3 篇 carnegie mellon ...
  • 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 篇 dipartimento di ...
  • 2 篇 dept. of compute...
  • 2 篇 at and t bell la...
  • 2 篇 sandia national ...
  • 2 篇 ibm t.j. watson ...
  • 2 篇 computer science...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...

作者

  • 12 篇 blelloch guy e.
  • 12 篇 gibbons phillip ...
  • 6 篇 reif john h.
  • 6 篇 leiserson charle...
  • 5 篇 muthukrishnan s.
  • 5 篇 goodrich michael...
  • 5 篇 matias yossi
  • 4 篇 uzi vishkin
  • 4 篇 ramachandran vij...
  • 4 篇 tangwongsan kana...
  • 4 篇 vitter jeffrey s...
  • 4 篇 simhadri harsha ...
  • 4 篇 gu yan
  • 4 篇 phillip b. gibbo...
  • 3 篇 snir marc
  • 3 篇 tarjan robert e.
  • 3 篇 cormen thomas h.
  • 3 篇 dhulipala laxman
  • 3 篇 deng xiaotie
  • 3 篇 monien burkhard

语言

  • 420 篇 英文
  • 16 篇 其他
检索条件"任意字段=Proceedings of the second annual ACM symposium on Parallel algorithms and architectures"
436 条 记 录,以下是371-380 订阅
排序:
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... 详细信息
来源: 评论
parallel resource allocation algorithms on macro-pipeline architectures  19
Parallel resource allocation algorithms on macro-pipeline ar...
收藏 引用
19th annual Conference on Computer Science, CSC 1991
作者: Mossaad, Karam M. Wu, Chaun-Lin Computer Science Department South West Texas State University at San Marcos United States Electrical and Computer Engineering Department University of Texas at Austin United States
Resource Allocation is one of the interesting problems in a high speed multiprocess/multiresource environment. In this paper, we present two novel parallel resource allocation algorithms using macro-pipeline architect... 详细信息
来源: 评论
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... 详细信息
来源: 评论
ON FINDING MINIMAL 2-CONNECTED SUBGRAPHS  53
ON FINDING MINIMAL 2-CONNECTED SUBGRAPHS
收藏 引用
2ND annual SYMP OF THE ASSOC FOR COMPUTING MACHINERY AND THE SOC FOR INDUSTRIAL AND APPLIED MATHEMATICS : DISCRETE algorithms
作者: KELSEN, P RAMACHANDRAN, V Department of Computer Sciences University of Texas Austin 78712 TX United States
We present efficient parallel algorithms for the problems of finding a minimal 2-edge-connected spanning subgraph of a 2-edge-connected graph and finding a minimal biconnected spanning subgraph of a biconnected graph.... 详细信息
来源: 评论
A SUBLINEAR-TIME RANDOMIZED parallel ALGORITHM FOR THE MAXIMUM CLIQUE PROBLEM IN PERFECT GRAPHS  53
A SUBLINEAR-TIME RANDOMIZED PARALLEL ALGORITHM FOR THE MAXIM...
收藏 引用
2ND annual SYMP OF THE ASSOC FOR COMPUTING MACHINERY AND THE SOC FOR INDUSTRIAL AND APPLIED MATHEMATICS : DISCRETE algorithms
作者: ALIZADEH, F Computer Science Department University of Minnesota Minneapolis 55455 MN United States
We will show that Lovasz number of graphs may be computed using interior-point methods. This technique will require O(√|V|) iterations, each consisting of matrix operations which have polylog parallel time complexity... 详细信息
来源: 评论
Balanced routing. Towards the distance bound on grids  91
Balanced routing. Towards the distance bound on grids
收藏 引用
3rd annual acm symposium on parallel algorithms and architectures - SPAA'91
作者: Kunde, M. Institut f. Informatik TU Munich Arcisstr. 21 D-8000 Munich 2 Germany
The problem of packet routing on an r-dimensional mesh-connected array or grid of processors with side-length n is studied. Each processor is able to store rf(n) packets, f(n) 1-1/r. The new class of balanced routing ... 详细信息
来源: 评论