咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是71-80 订阅
排序:
Brief Announcement: Low Depth Cache-Oblivious Sorting  09
Brief Announcement: Low Depth Cache-Oblivious Sorting
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Blelloch, Guy E. Gibbons, Phillip B. Simhadri, Harsha Vardhan Carnegie Mellon Univ Pittsburgh PA 15213 USA
Cache-oblivious algorithms have the advantage of achieving good sequential cache complexity across all levels of a multi-level cache hierarchy, regardless of the specifies (cache size and cache line size) of each leve... 详细信息
来源: 评论
SPAA'09 - proceedings of the 21st annual symposium on parallelism in algorithms and architectures
SPAA'09 - Proceedings of the 21st Annual Symposium on Parall...
收藏 引用
21st annual symposium on parallelism in algorithms and architectures, SPAA'09
The proceedings contain 43 papers. The topics discussed include: speed scaling of processes with arbitrary speedup curves on a multiprocessor;the bell is ringing in speed-scaled multiprocessor scheduling;mapping filte...
来源: 评论
Inherent Limitations on Disjoint-Access parallel Implementations of Transactional Memory (Preliminary Version)  09
Inherent Limitations on Disjoint-Access Parallel Implementat...
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Attiya, Hagit Hillel, Eshcar Milani, Alessia Technion Israel Inst Technol Dept Comp Sci IL-32000 Haifa Israel
Transactional memory (TM) is a promising approach for designing concurrent data structures, and it is essential to develop better understanding of the formal properties that can be achieved by TM implementations. Two ... 详细信息
来源: 评论
parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Multiplication Using Compressed Sparse Blocks  09
Parallel Sparse Matrix-Vector and Matrix-Transpose-Vector Mu...
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Buluc, Aydin Fineman, Jeremy T. Frigo, Matteo Gilbert, John R. Leiserson, Charles E. Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA
This paper introduces a storage format for sparse matrices, called compressed sparse blocks (CSB), which allows both Ax and A(x)(inverted perpendicular) to be computed efficiently in parallel, where A is an n x n spar... 详细信息
来源: 评论
Field-Split parallel Architecture for High Performance Multi-Match Packet Classification Using FPGAs  09
Field-Split Parallel Architecture for High Performance Multi...
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Jiang, Weirong Prasanna, Viktor K. Univ So Calif Ming Hsieh Dept Elect Engn Los Angeles CA 90089 USA
Multi-match packet classification is a critical function in network intrusion detection systems (NIDS), where all matching rules for a packet need to be reported. Most of the previous work is based on ternary content ... 详细信息
来源: 评论
Beyond Nested parallelism: Tight Bounds on Work-Stealing Overheads for parallel Futures  09
Beyond Nested Parallelism: Tight Bounds on Work-Stealing Ove...
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Spoonhower, Daniel Blelloch, Guy E. Gibbons, Phillip B. Harper, Robert Carnegie Mellon Univ Pittsburgh PA 15213 USA
Work stealing is a popular method of scheduling fine-grained parallel tasks. The performance of work stealing has been extensively studied, both theoretically and empirically, but primarily for the restricted class of... 详细信息
来源: 评论
Communication-Optimal parallel and Sequential Cholesky Decomposition  09
Communication-Optimal Parallel and Sequential Cholesky Decom...
收藏 引用
21st acm symposium on parallelism in algorithms and architectures
作者: Ballard, Grey Demmel, James Holtz, Olga Schwartz, Oded Univ Calif Berkeley Dept Comp Sci Berkeley CA 94720 USA
Numerical algorithms have two kinds of costs: arithmetic and communication, by which we mean either moving data between levels of a memory hierarchy (in the sequential case) or over a network connecting processors (in... 详细信息
来源: 评论
Brief Announcement: Optimal Speedup on a Low-Degree Multi-Core parallel Architecture (LoPRAM)
Brief Announcement: Optimal Speedup on a Low-Degree Multi-Co...
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Dorrigiv, Reza Lopez-Ortiz, Alejandro Salinger, Alejandro Univ Waterloo Sch Comp Sci Waterloo ON N2L 3G1 Canada
Over the last five years, major microprocessor manufacturers have released plans for a rapidly increasing number of cores per microprossesor, with upwards of 64 cores by 2015. In this setting, a sequential RAM compute... 详细信息
来源: 评论
Fundamental parallel algorithms for Private-Cache Chip Multiprocessors  08
Fundamental Parallel Algorithms for Private-Cache Chip Multi...
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Arge, Lars Goodrich, Michael T. Nelson, Michael Sitchinava, Nodari Univ Aarhus MADALGO Aarhus Denmark Univ Calif Irvine Irvine CA 92697 USA
In this paper, we study parallel algorithms for private-cache chip multiprocessors (CMPs), focusing on methods for foundational problems that are scalable with the number of cores. By focusing on private-cache CMPs, w... 详细信息
来源: 评论
Directed Transmission Method, a Fully Asynchronous Approach to Solve Sparse Linear Systems in parallel  08
Directed Transmission Method, a Fully Asynchronous Approach ...
收藏 引用
20th acm symposium on parallelism in algorithms and architectures
作者: Wei, Fei Yang, Huazhong Tsinghua Univ Dept Elect Engn Beijing Peoples R China
There are many algorithms to solve large sparse linear systems in parallel;however, most of them acquire synchronization and thus are lack of scalability. In this paper, we propose a new distributed numerical algorith... 详细信息
来源: 评论