咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 82 篇 parallel algorit...
  • 68 篇 parallel process...
  • 13 篇 computer program...
  • 12 篇 parallel program...
  • 9 篇 scheduling
  • 7 篇 computer archite...
  • 7 篇 pram
  • 6 篇 computer systems...
  • 5 篇 graph algorithms
  • 4 篇 performance
  • 4 篇 parallel archite...
  • 4 篇 approximation al...
  • 4 篇 multithreading
  • 4 篇 transactional me...
  • 4 篇 work stealing
  • 3 篇 parallel process...
  • 3 篇 parallelism
  • 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 篇 miller gary l.
  • 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 篇 gu yan

语言

  • 357 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures"
370 条 记 录,以下是361-370 订阅
排序:
Optimal parallel suffix-prefix matching algorithm and applications  89
Optimal parallel suffix-prefix matching algorithm and applic...
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Kedera, Zvi M. Landau, Gad M. Palem, Krishna V. Department of Computer Science Courant Institute of Mathematical Sciences New York University 251 Mercer St. New YorkNY United States Computer Science Division Polytechnic Univ. 333 Jay St. Brooklyn New YorkNY11201 United States IBM Research Division P. O. Box 704 Yorktown HeightsNY10598 United States
Our main result in this paper is a parallel algorithm for suffiz-prefix matching that has optimal speedup on a CRCW PRAM. It runs in time O(logn) using n/log n processors. This algorithm is important because we utihze... 详细信息
来源: 评论
Interprocessor communication speed and performance in distributed-memory parallel processors.  89
Interprocessor communication speed and performance in distri...
收藏 引用
16th annual International symposium on Computer Architecture
作者: Annaratone, Marco Pommerell, Claude Ruhl, Roland Swiss Fed Inst of Technology Zurich Switz
The authors have simulated several numerical and nonnumerical algorithms on five distributed-memory parallel processors (DMPPs). All five DMPPs have the same topology (a torus) and the same number of nodes. The archit... 详细信息
来源: 评论
parallel graph contraction  89
Parallel graph contraction
收藏 引用
1st annual acm symposium on parallel algorithms and architectures, SPAA 1989
作者: Phillips, Cynthia A. Laboratory for Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States
This paper shows how n-node, e-edge graphs can be contracted in a manner similar to the parallel tree contraction algorithm due to Miller and Reif. We give an O((n + e)/lgn)-processor deterministic algorithm that cont... 详细信息
来源: 评论
proceedings OF THE nineteenth annual acm symposium ON THEORY OF COMPUTING.
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM SYMPOSIUM ON THEORY...
收藏 引用
proceedings of the nineteenth annual acm symposium on Theory of Computing.
作者: Anon
This conference proceedings contains 50 papers. The topics covered include: algorithms;graph theory;parallel processing;automata;Boolean circuits;computational geometry;cryptography;complexity;distributed computing.
来源: 评论
proceedings OF THE nineteenth annual acm symposium ON THEORY OF COMPUTING.
PROCEEDINGS OF THE NINETEENTH ANNUAL ACM SYMPOSIUM ON THEORY...
收藏 引用
Conf Proc Annu acm Symp Theory Comput 19th, Proc nineteenth Annu acm Symp Theory Comput
作者: Anon ACM Special Interest Group for Automata and Computability Theory New York NY USA ACM Special Interest Group for Automata and Computability Theory New York NY USA
This conference proceedings contains 50 papers. The topics covered include: algorithms;graph theory;parallel processing;automata;boolean circuits;computational geometry;cryptography;complexity;distributed computing.
来源: 评论
FAST parallel algorithms FOR CHORDAL GRAPHS.  87
FAST PARALLEL ALGORITHMS FOR CHORDAL GRAPHS.
收藏 引用
proceedings of the nineteenth annual acm symposium on Theory of Computing.
作者: Naor, Joseph Naor, Moni Schaeffer, Alejandro A. Hebrew Univ Jerusalem Isr Hebrew Univ Jerusalem Isr
We present an NC algorithm for recognizing chordal graphs, and we present NC algorithms for finding the following objects on chordal graphs: all maximal cliques, an intersection graph representation, an optimal colori... 详细信息
来源: 评论
parallel SYMMETRY-BREAKING IN SPARSE GRAPHS.  87
PARALLEL SYMMETRY-BREAKING IN SPARSE GRAPHS.
收藏 引用
proceedings of the nineteenth annual acm symposium on Theory of Computing.
作者: Goldberg, Andrew V. Plotkin, Serge A. Shannon, Gregory E. MIT Cambridge MA USA MIT Cambridge MA USA
We describe efficient deterministic techniques for breaking symmetry in parallel. The techniques work well on rooted trees and graphs of constant degree or genus. Our primary technique allows us to 3-color a rooted tr... 详细信息
来源: 评论
DYNAMIC parallel COMPLEXITY OF COMPUTATIONAL CIRCUITS.  87
DYNAMIC PARALLEL COMPLEXITY OF COMPUTATIONAL CIRCUITS.
收藏 引用
proceedings of the nineteenth annual acm symposium on Theory of Computing.
作者: Miller, Gary L. Teng, Shang-Hua Univ of Southern California Los Angeles CA USA Univ of Southern California Los Angeles CA USA
The dynamic parallel complexity of general computational circuits is discussed. We exhibit some relationships between parallel circuit evaluation and some uniform closure properties of a certain class of unary functio... 详细信息
来源: 评论
parallel algorithms AND architectures FOR RULE-BASED SYSTEMS.
PARALLEL ALGORITHMS AND ARCHITECTURES FOR RULE-BASED SYSTEMS...
收藏 引用
13th annual International symposium on Computer Architecture - Conference proceedings.
作者: Gupta, Anoop Forgy, Charles Newell, Allen Wedig, Robert Carnegie-Mellon Univ Pittsburgh PA USA Carnegie-Mellon Univ Pittsburgh PA USA
Rule-based systems appear to be capable of exploiting large amounts of parallelism, because it is possible to match each rule to the data memory in parallel. It is pointed out that in practice the speedup from paralle... 详细信息
来源: 评论
MODELS FOR USE IN THE DESIGN OF MACRO-PIPELINED parallel PROCESSORS.
MODELS FOR USE IN THE DESIGN OF MACRO-PIPELINED PARALLEL PRO...
收藏 引用
Conference proceedings - 12th annual International symposium on Computer Architecture.
作者: Smith, Bradley Warren Siegel, Howard Jay Purdue Univ Sch of Electrical Engineering West Lafayette IN USA Purdue Univ Sch of Electrical Engineering West Lafayette IN USA
An approach is proposed for modeling off-the-shelf hardware and for modeling parallel algorithms, along with a design methodology to use the information provided by these models, to design a class of macro-pipelined s... 详细信息
来源: 评论