咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是141-150 订阅
排序:
Recursive array layouts and fast parallel matrix multiplication
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 222-231页
作者: Chatterjee, Siddhartha Lebeck, Alvin R. Patnala, Praveen K. Thottethodi, Mithuna Univ of North Carolina Chapel Hill NC United States
Matrix multiplication is an important kernel in linear algebra algorithms, and the performance of both serial and parallel implementations is highly dependent on the memory system behavior. Unfortunately, due to false... 详细信息
来源: 评论
Experience with an adaptive globally-synchronizing clock algorithm
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 106-114页
作者: Liao, Cheng Martonosi, Margaret Clark, Douglas W. Princeton Univ Princeton NJ United States
Fast commodity network-connected PC or workstation clusters are becoming more and more popular. This popularity can be attributed to their ability to provide high-performance parallel computing on a relatively inexpen... 详细信息
来源: 评论
Tradeoffs between parallelism and fill in nested dissection
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 191-200页
作者: Bornstein, Claudson F. Maggs, Bruce M. Miller, Gary L. Universidade Federal do Rio de Janeiro Rio de Janeiro Brazil
In this paper we demonstrate that parallelism and fill can be traded off in orders for Gaussian elimination. While the well-known nested dissection algorithm produces very parallel elimination orders, we show that by ... 详细信息
来源: 评论
System-level specification framework for I/O architectures
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 138-147页
作者: Hill, Mark D. Condon, Anne E. Plakal, Manoj Sorin, Daniel J. Univ of Wisconsin-Madison Madison United States
A computer system is useless unless it can interact with the outside world through input/output (I/O) devices. I/O systems are complex, including aspects such as memory-mapped operations, interrupts, and bus bridges. ... 详细信息
来源: 评论
A simple and efficient parallel disk mergesort  99
A simple and efficient parallel disk mergesort
收藏 引用
proceedings of the eleventh annual acm symposium on parallel algorithms and architectures
作者: Rakesh D. Barve Jeffrey Scott Vitter Center for Geometric Computing Duke University
来源: 评论
Multidimensional, multiprocessor, out-of-core FFTs with distributed memory and parallel disks (extended abstract)  99
Multidimensional, multiprocessor, out-of-core FFTs with dist...
收藏 引用
proceedings of the eleventh annual acm symposium on parallel algorithms and architectures
作者: Lauren M. Baptist Thomas H. Cormen Dartmouth College Department of Computer Science
来源: 评论
Selecting tile shape for minimal execution time
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 201-211页
作者: Hogstedt, Karin Carter, Larry Ferrante, Jeanne Univ of California at San Diego La Jolla CA United States
Many computationally-intensive programs, such as those for differential equations, spatial interpolation, and dynamic programming, spend a large portion of their execution time in multiply-nested loops which have a re... 详细信息
来源: 评论
Data management in networks: Experimental evaluation of a provably good strategy
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 165-174页
作者: Krick, Christof Meyer auf der Heide, Friedhelm Raecke, Harald Voecking, Berthold Westermann, Matthias Univ of Paderborn Paderborn Germany
This paper deals with data management for parallel and distributed systems in which the computing nodes are connected by a relatively sparse network. We present the DIVA (Distributed Variables) library that provides f... 详细信息
来源: 评论
Efficient parallel solutions of linear algebraic circuits  99
Efficient parallel solutions of linear algebraic circuits
收藏 引用
proceedings of the eleventh annual acm symposium on parallel algorithms and architectures
作者: Yosi Ben-Asher Gady Haber Dep. of Computer Science Haifa University 31905 Haifa Israel System Division IBM Science and Technology Haifa Israel
来源: 评论
Making sparse matrix computations scalable
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 1-1页
作者: Demmel, Jim Univ of California Berkeley United States
Sparse matrix computations are ubiquitous in science and engineering. In particular, solving a sparse linear system of equations is the bottleneck in many computations. Of the many available algorithms, some are easy ... 详细信息
来源: 评论