咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是391-400 订阅
排序:
Lower bounds for parallel computation on linked structures  90
Lower bounds for parallel computation on linked structures
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Fich, Faith E. Univ of Toronto Toronto Ont Canada
The time required to compute any function of a collection of circular doubly linked lists on a CROW PRAM is shown to be at most a constant factor more than on a CREW PRAM, but this is not true for singly linked lists.... 详细信息
来源: 评论
Unified approach to off-line permutation routing on parallel networks
Unified approach to off-line permutation routing on parallel...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Annexstein, Fred Baumslag, Marc Univ of Massachusetts Amherst United States
A unified framework for finding efficient permutation routes on parallel networks in an off-line setting is presented. If the underlying graph of a parallel network contains an appropriate 'approximate' produc... 详细信息
来源: 评论
Low overhead parallel schedules for task graphs  90
Low overhead parallel schedules for task graphs
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Anderson, Richard J. Beame, Paul Ruzzo, Walter L. Univ of Washington WA United States
We introduce a task scheduling model which is useful in the design and analysis of algorithms for small parallel machines. We prove that under our model, the overhead experienced in scheduling an n × n grid graph... 详细信息
来源: 评论
Foundation for sequentializing parallel code
Foundation for sequentializing parallel code
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Simons, Barbara Alpern, David Ferrante, Jeanne IBM Almaden Research Cent San Jose United States
The Program Dependence Graph (PDG), which represents the data and the control dependences of a program is considered. Attention is limited to the subgraph of the PDG which contains only the control dependence edges. T... 详细信息
来源: 评论
Space-efficient representations of shared data for parallel computers  90
Space-efficient representations of shared data for parallel ...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Herley, Kieran T. Cornell Univ Itaca NY United States
The problem of representing a set U = {u1, ..., um} of read-write variables on an n-node distributed memory parallel computer is considered. It is shown that U can be represented among the n nodes of a variant of the ... 详细信息
来源: 评论
parallel searching in generalized monge arrays with applications  90
Parallel searching in generalized monge arrays with applicat...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Aggarwal, Alok Kravets, Dina Park, James K. Sen, Sandeep T. J. Watson Research Cent Yorktown Heights NY United States
This paper investigates the parallel time and processor complexities of several searching problems involving Monge and Monge-composite arrays. We present array-searching algorithms for concurrent-read-concurrent-write... 详细信息
来源: 评论
parallel algorithms for generating random permutations on a shared memory machine  90
Parallel algorithms for generating random permutations on a ...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Anderson, Richard J. Univ of Washington WA United States
In this paper we consider the problem of generating random permutations on small parallel machines. The machines that we have in mind are shared memory machines with a constant number of processors such as the Sequent... 详细信息
来源: 评论
Randomized parallel algorithm for planar graph isomorphism
Randomized parallel algorithm for planar graph isomorphism
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Gazit, Hillel Reif, John H. Duke Univ Durham United States
We present a parallel randomized algorithm for finding if two planar graphs are isomorphic. Assuming that we have a tree of separators for each planar graph, our algorithm takes O(log(n)) time with P = (n1.5&middo... 详细信息
来源: 评论
High-probability parallel transitive closure algorithms  90
High-probability parallel transitive closure algorithms
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Ullman, Jeffrey D. Yannakakis, Mihalis Stanford Univ Stanford KY United States
The authors address the apparently difficult problem of doing parallel transitive closure when the (directed) graph is sparse and/or, only single-source information is desired. O(e) work is their target for the single... 详细信息
来源: 评论
Fast fault-tolerant parallel communication and on-line maintenance using information dispersal  90
Fast fault-tolerant parallel communication and on-line maint...
收藏 引用
SPAA '90 - proceedings of the 2nd annual acm symposium on parallel algorithms and architectures
作者: Lyuu, Yuh-Dauh Harvard Univ Cambridge MA United States
Space-efficient Information Dispersal Algorithm (IDA) [11] is applied to parallel communication in the hypercube. Let N denote the size of the network. Our communication scheme runs in 2·log N + 1 time using cons... 详细信息
来源: 评论