咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是291-300 订阅
排序:
Industrial presentation. The scalable parallel operating system PARIX
Industrial presentation. The scalable parallel operating sys...
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Langhammer, Falk
来源: 评论
Industrial presentation. VOLVOX. An operating system for massively parallel computers
Industrial presentation. VOLVOX. An operating system for mas...
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Tricot, Christian
来源: 评论
Optical communication parallel computer
Optical communication parallel computer
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Goldberg, Leslie Ann Jerrum, Mark Leighton, Tom
来源: 评论
Scalable parallel computing. The SPI Product
Scalable parallel computing. The SPI Product
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Snir, Marc Watson, T.J.
来源: 评论
On Gazit and Miller's parallel algorithm for planar separators. Achieving greater efficiency through random sampling  93
On Gazit and Miller's parallel algorithm for planar separato...
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Klein, Philip Brown University United States
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires 0(n) time for any given positive constant e. © 1993 acm.
来源: 评论
An implementation of the e-relaxation algorithm on the CM-5  5
An implementation of the e-relaxation algorithm on the CM-5
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Narendran, B. De Leone, Renato Tiwari, Prasoon Computer Sciences Department University of Wisconsin-Madison MadisonWI53706 United States
This paper discusses a parallel implementation of the e-relaxation algorithm for the min-cost flow problem on the CM-5. There is considerable loss in efficiency in going from one processor sequential implementation to... 详细信息
来源: 评论
Scan grammars: parallel attribute evaluation via data-parallelism  93
Scan grammars: Parallel attribute evaluation via data-parall...
收藏 引用
5th annual acm symposium on parallel algorithms and architectures, SPAA 1993
作者: Reps, Thomas University of Wisconsin United States
This paper concerns the problem of how to exploit parallelism during the phases of compilation involving syntax-directed analysis and translation. In particular, we address the problem of how to exploit parallelism du... 详细信息
来源: 评论
Fast deterministic approximate and exact parallel sorting  93
Fast deterministic approximate and exact parallel sorting
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Hagerup, Torben Max-Planck-Institut Für Informatik Im Stadtwald Saarbrücken W-6600 Germany UMIACS University of Maryland College Park 20742 MD United States
Padded sorting requires n input keys to be output in sorted order in an array with slightly more than n locations, unused locations being filled with a special null value. We show that a deterministic CRCW PRAM with k... 详细信息
来源: 评论
Bounds on the efficiency of message-passing protocols for parallel computers  93
Bounds on the efficiency of message-passing protocols for pa...
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Cypher, Robert Konstantinidou, Smaragda IBM Almaden Research Center San Jose CA
This paper considers the problem of creating message-passing protocols for parallel computers. It is assumed that the processors are connected by a network that provides guaranteed delivery of every message, provided ... 详细信息
来源: 评论
Fast parallel matching in expander graphs  93
Fast parallel matching in expander graphs
收藏 引用
proceedings of the 5th annual acm symposium on parallel algorithms and architectures
作者: Kelson, Pierre Univ. of British Columbia Vancouver B.C. Canada
Let iT be a bipartite graph with bipartition (A, B) where \A\-n and every subset X of A with at most a n elements has at least b\X\ neighbors (o 1). We consider the problem of computing a matching from a given subset... 详细信息
来源: 评论