咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

  • 82 篇 parallel algorit...
  • 68 篇 parallel process...
  • 12 篇 parallel program...
  • 11 篇 computer program...
  • 9 篇 scheduling
  • 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
  • 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 篇 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 篇 miller gary l.
  • 3 篇 gu yan

语言

  • 352 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures"
365 条 记 录,以下是231-240 订阅
排序:
Optimal randomized planar convex hull algorithm with good empirical performance
Optimal randomized planar convex hull algorithm with good em...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Dyer, Martin Nash, Jonathan Dew, Peter Univ of Leeds Leeds United Kingdom
We describe a new randomized parallel algorithm for computing the planar convex hull of n points on a p processor-memory pair machine communicating through a network for which O(log p) routing is possible. We show tha... 详细信息
来源: 评论
Don't be too clever: routing BMMC permutations on the MasPar MP-2
Don't be too clever: routing BMMC permutations on the MasPar...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Cormen, Thomas H. Bruhl, Kristin Dartmouth Coll
We implemented and measured several methods to perform BMMC permutations on the MasPar MP-2. Our results indicate that, except for certain types of permutations or very high virtual processor ratios, the best method o... 详细信息
来源: 评论
Optimal parallel dictionary matching and compression
Optimal parallel dictionary matching and compression
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Farach, Martin Muthukrishnan, S. Rutgers Univ
Emerging applications in multi-media and the Human Genome Project require storage and searching of large databases of strings - a task for which parallelism seems the only hope. In this paper, we consider the parallel... 详细信息
来源: 评论
Approximating biconnectivity in parallel  95
Approximating biconnectivity in parallel
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Chong, Ka Wong Lam, Tak Wah Univ of Hong Kong Hong Kong
Consider the following NP-hard problems: Given a graph G, find the minimum 2-edge connected and 2-vertex connected subgraphs spanning all vertices of G. The past few years have produced exciting sequential algorithms ... 详细信息
来源: 评论
Finding connected components on a scan line array processor  95
Finding connected components on a scan line array processor
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Greenberg, Ronald I. Univ of Maryland College Park MD United States
This paper provides a new approach to labeling the connected components of an n × n image on a scan line array processor (comprised of n processing elements). Variations of this approach yield an algorithm guaran... 详细信息
来源: 评论
Future applicability of bus-based shared memory multiprocessors  95
Future applicability of bus-based shared memory multiprocess...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Sundaram, C.R.M. Eager, Derek L. Univ of Saskatchewan Saskatoon Sask Canada
This paper addresses the question of the future applicability of bus-based multiprocessors, by studying the execution characteristics of a number of data parallel numerical and scientific applications, as the system p... 详细信息
来源: 评论
parallel molecular computation  95
Parallel molecular computation
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Reif, John H. Duke Univ
Techniques for quickly executing lengthy computations by the use of molecular parallelism are described. It is demonstrated that molecular computations can be done using short DNA strands by more or less conventional ... 详细信息
来源: 评论
LogGP: incorporating long messages into the LogP model - one step closer towards a realistic model for parallel computation
LogGP: incorporating long messages into the LogP model - one...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Alexandrov, Albert Ionescu, Mihai F. Schauser, Klaus E. Scheiman, Chris Univ of California Santa Barbara United States
The original LogP model for parallel computation use four parameters;the communication latency (L), overhead (n), bandwidth (g), and the number of processors (P). This basic model is extended with a linear model for l... 详细信息
来源: 评论
Provably efficient scheduling for languages with fine-grained parallelism  95
Provably efficient scheduling for languages with fine-graine...
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Blelloch, Guy E. Gibbons, Phillip B. Matias, Yossi Carnegie Mellon Univ Pittsburgh PA United States
Most high-level parallel programming languages allow for fine-grained parallelism. Programs written in such languages can express the full parallelism in the program without specifying the mapping of program tasks to ... 详细信息
来源: 评论
Efficient techniques for fast nested barrier synchronization  95
Efficient techniques for fast nested barrier synchronization
收藏 引用
proceedings of the 7th annual acm symposium on parallel algorithms and architectures, SPAA'95
作者: Ramakrishnan, Vara Scherson, Isaac D. Subramanian, Raghu Univ of California Irvine CA United States
Two hardware barrier synchronization schemes are presented which can support deep levels of control nesting in data parallel programs. Hardware barriers are usually an order of magnitude faster than software implement... 详细信息
来源: 评论