咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 252 篇 工学
    • 249 篇 计算机科学与技术...
    • 163 篇 软件工程
    • 25 篇 电气工程
    • 23 篇 信息与通信工程
    • 17 篇 控制科学与工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 3 篇 生物工程
    • 2 篇 机械工程
    • 2 篇 生物医学工程(可授...
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
    • 1 篇 化学工程与技术
  • 146 篇 理学
    • 143 篇 数学
    • 23 篇 统计学(可授理学、...
    • 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
  • 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 maryland de...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...

作者

  • 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

语言

  • 353 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures"
366 条 记 录,以下是141-150 订阅
排序:
Closer look at coscheduling approaches for a network of workstations
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 96-105页
作者: Nagar, Shailabh Banerjee, Ajit Sivasubramaniam, Anand Das, Chita R. Pennsylvania State Univ University Park United States
Efficient scheduling of processes on processors of a Network of Workstations (NOW) is essential for good system performance. The design of such schedulers is a complex interaction between several system and workload p... 详细信息
来源: 评论
BOS is boss: A case for bulk-synchronous object systems
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 115-125页
作者: Goudreau, Mark W. Lang, Kevin Narlikar, Girija Rao, Satish B. NEC USA Inc Princeton United States
A key issue for parallel systems is the development of useful programming abstractions that can coexist with good performance. We describe a communication library that supports an object-based abstraction with a bulk-... 详细信息
来源: 评论
Scheduling threads for low space requirement and good locality
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 83-95页
作者: Narlikar, Girija J. CMU Sch of Computer Science
A simple, asynchronous, space-efficient scheduling algorithm for shared memory machines was developed. The algorithm combined the low scheduling overheads and good locality of work stealing with the low space requirem... 详细信息
来源: 评论
Post-mortem black-box correctness tests for basic parallel data structures  99
Post-mortem black-box correctness tests for basic parallel d...
收藏 引用
proceedings of the eleventh annual acm symposium on parallel algorithms and architectures
作者: Phillip B. Gibbons John L. Bruno Steven Phillips Bell Laboratories Lucent Technologies Room 2A-341 600 Mountain Avenue Murray Hill NJ Dept. of Computer Science University of California Santa Barbara CA AT&T Labs - Research Florham Park NJ
来源: 评论
Efficient approximation algorithms for scheduling malleable tasks
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 23-32页
作者: Mounie, Gregory Rapine, Christophe Trystram, Denis IMAG Grenoble France
A malleable task is a computational unit which may be executed on any arbitrary number of processors, its execution time depending on the amount of resources allotted to it. According to the standard behavior of paral... 详细信息
来源: 评论
Multidimensional, multiprocessor, out-of-core FFTs with distributed memory and parallel disks
Annual ACM Symposium on Parallel Algorithms and Architecture...
收藏 引用
annual acm symposium on parallel algorithms and architectures 1999年 242-250页
作者: Baptist, Lauren M. Cormen, Thomas H. Dartmouth Coll Hannover United States
We show how to compute multidimensional Fast Fourier Transforms (FFTs) on a multiprocessor system with distributed memory when problem sizes are so large that the data do not fit in the memory of the entire system. In... 详细信息
来源: 评论
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. ... 详细信息
来源: 评论