咨询与建议

限定检索结果

文献类型

  • 1,504 篇 会议
  • 105 篇 期刊文献

馆藏范围

  • 1,609 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,168 篇 工学
    • 1,111 篇 计算机科学与技术...
    • 557 篇 软件工程
    • 118 篇 电气工程
    • 75 篇 信息与通信工程
    • 46 篇 控制科学与工程
    • 37 篇 电子科学与技术(可...
    • 13 篇 材料科学与工程(可...
    • 13 篇 农业工程
    • 11 篇 机械工程
    • 11 篇 光学工程
    • 8 篇 化学工程与技术
    • 8 篇 生物工程
    • 7 篇 建筑学
    • 7 篇 生物医学工程(可授...
    • 6 篇 动力工程及工程热...
    • 5 篇 土木工程
    • 3 篇 力学(可授工学、理...
  • 579 篇 理学
    • 557 篇 数学
    • 55 篇 统计学(可授理学、...
    • 16 篇 物理学
    • 9 篇 生物学
    • 9 篇 系统科学
    • 8 篇 化学
  • 73 篇 管理学
    • 64 篇 管理科学与工程(可...
    • 40 篇 工商管理
    • 10 篇 图书情报与档案管...
  • 16 篇 农学
    • 16 篇 作物学
  • 6 篇 经济学
    • 6 篇 应用经济学
  • 3 篇 法学
    • 3 篇 社会学
  • 3 篇 教育学
    • 3 篇 教育学
  • 2 篇 医学
  • 1 篇 文学
  • 1 篇 军事学

主题

  • 237 篇 parallel algorit...
  • 173 篇 parallel process...
  • 80 篇 computer archite...
  • 74 篇 parallel process...
  • 57 篇 parallel program...
  • 55 篇 algorithms
  • 47 篇 parallel archite...
  • 41 篇 hardware
  • 30 篇 scheduling
  • 27 篇 computer program...
  • 21 篇 graph algorithms
  • 20 篇 computer systems...
  • 18 篇 approximation al...
  • 18 篇 processor schedu...
  • 18 篇 computational mo...
  • 18 篇 field programmab...
  • 17 篇 parallel computi...
  • 16 篇 computer science
  • 16 篇 performance
  • 16 篇 delay

机构

  • 32 篇 carnegie mellon ...
  • 15 篇 swiss fed inst t...
  • 15 篇 carnegie mellon ...
  • 11 篇 univ maryland de...
  • 11 篇 stanford univ st...
  • 10 篇 univ maryland co...
  • 10 篇 mit 77 massachus...
  • 10 篇 univ calif berke...
  • 8 篇 eth zurich
  • 7 篇 georgetown univ ...
  • 7 篇 mit cambridge ma...
  • 7 篇 univ texas austi...
  • 6 篇 penn state univ ...
  • 6 篇 mit csail cambri...
  • 5 篇 univ calif river...
  • 5 篇 princeton univer...
  • 5 篇 university of ma...
  • 5 篇 microsoft res re...
  • 5 篇 carnegie mellon ...
  • 5 篇 harvard univ cam...

作者

  • 38 篇 blelloch guy e.
  • 20 篇 gu yan
  • 18 篇 gibbons phillip ...
  • 18 篇 shun julian
  • 18 篇 goodrich michael...
  • 16 篇 fineman jeremy t...
  • 15 篇 sun yihan
  • 14 篇 dhulipala laxman
  • 13 篇 vishkin uzi
  • 12 篇 agrawal kunal
  • 11 篇 leiserson charle...
  • 10 篇 ballard grey
  • 10 篇 hoefler torsten
  • 10 篇 anon
  • 10 篇 miller gary l.
  • 10 篇 harris david g.
  • 9 篇 ghaffari mohsen
  • 9 篇 tangwongsan kana...
  • 9 篇 reif john h.
  • 9 篇 demmel james

语言

  • 1,569 篇 英文
  • 40 篇 其他
检索条件"任意字段=Annual ACM Symposium on Parallel Algorithms and Architectures"
1609 条 记 录,以下是541-550 订阅
排序:
Special Section on PAR-CAD: parallel CAD algorithms and CAD for parallel architectures/Systems
收藏 引用
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2012年 第1期31卷 7-8页
作者: Marculescu, Diana Li, Peng Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Texas A&M Univ Dept Elect & Comp Engn College Stn TX 77843 USA
The five papers in this special section on PAR-CAD: parallel CAD algorithms and CAD for parallel architectures/systems.
来源: 评论
Clustering Affine Subspaces: Hardness and algorithms  13
Clustering Affine Subspaces: Hardness and Algorithms
收藏 引用
symposium on Discrete algorithms
作者: Euiwoong Lee Leonard J. Schulman CMU Caltech.
We study a generalization of the famous κ-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinati... 详细信息
来源: 评论
Boosting Memory Performance of Many-Core FPGA Device through Dynamic Precedence Graph
Boosting Memory Performance of Many-Core FPGA Device through...
收藏 引用
annual IEEE symposium on Field-Programmable Custom Computing Machines (FCCM)
作者: Yu Bai Abigail Fuentes Michael Riera Mohammed Alawad Mingjie Lin Department of Electrical Engineering and Computer Science University of Central Florida Orlando FL USA
Emerging FPGA device, integrated with abundant RAM blocks and high-performance processor cores, offers an unprecedented opportunity to effectively implement single-chip distributed logic-memory (DLM) architectures [1]... 详细信息
来源: 评论
Brief announcement: Speedups for parallel graph triconnectivity  12
Brief announcement: Speedups for parallel graph triconnectiv...
收藏 引用
24th acm symposium on parallelism in algorithms and architectures, SPAA'12
作者: Edwards, James A. Vishkin, Uzi University of Maryland College Park MD United States
We present a parallel solution to the problem of determining the triconnected components of an undirected graph. We obtain significant speedups over the only published optimal (linear-time) serial implementation of a ... 详细信息
来源: 评论
A parallel buffer tree  12
A parallel buffer tree
收藏 引用
24th acm symposium on parallelism in algorithms and architectures, SPAA'12
作者: Sitchinava, Nodari Zeh, Norbert Institite for Theoretical Informatics Karlsruhe Institute of Technology Germany Faculty of Computer Science Dalhousie University Canada
We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache ... 详细信息
来源: 评论
parallel and I/O efficient set covering algorithms  12
Parallel and I/O efficient set covering algorithms
收藏 引用
24th acm symposium on parallelism in algorithms and architectures, SPAA'12
作者: Blelloch, Guy E. Simhadri, Harsha Vardhan Tangwongsan, Kanat Carnegie Mellon University United States
This paper presents the design, analysis, and implementation of parallel and sequential I/O-efficient algorithms for set cover, tying together the line of work on parallel set cover and the line of work on efficient s... 详细信息
来源: 评论
parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design  12
Parallel probabilistic tree embeddings, k-median, and buy-at...
收藏 引用
24th acm symposium on parallelism in algorithms and architectures, SPAA'12
作者: Blelloch, Guy E. Gupta, Anupam Tangwongsan, Kanat Carnegie Mellon University United States
This paper presents parallel algorithms for embedding an arbitrary n-point metric space into a distribution of dominating trees with O(log n) expected stretch. Such embedding has proved useful in the design of many ap... 详细信息
来源: 评论
A (3/2 + Ε) approximation algorithm for scheduling moldable and non-moldable parallel tasks  12
A (3/2 + Ε) approximation algorithm for scheduling moldable...
收藏 引用
24th acm symposium on parallelism in algorithms and architectures, SPAA'12
作者: Jansen, Klaus Institut für Informatik Universität zu Kiel Olshausenstr. 40 D - 24098 Kiel Germany
In this paper we study a scheduling problem with moldable and non-moldable parallel tasks on m processors. A non-moldable parallel task is one that runs in parallel on a specific given number of processors. The goal i... 详细信息
来源: 评论
Brief announcement: Strong scaling of matrix multiplication algorithms and memory-independent communication lower bounds  12
Brief announcement: Strong scaling of matrix multiplication ...
收藏 引用
24th acm symposium on parallelism in algorithms and architectures, SPAA'12
作者: Ballard, Grey Demmel, James Holtz, Olga Lipshitz, Benjamin Schwartz, Oded UC Berkeley United States TU Berlin Germany
A parallel algorithm has perfect strong scaling if its running time on P processors is linear in 1/P, including all communication costs. Distributed-memory parallel algorithms for matrix multiplication with perfect st... 详细信息
来源: 评论
A lock-free B+tree  12
A lock-free B+tree
收藏 引用
24th acm symposium on parallelism in algorithms and architectures, SPAA'12
作者: Braginsky, Anastasia Petrank, Erez Dept. of Computer Science Technion Israel Institute of Technology Haifa 32000 Israel
Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design fo... 详细信息
来源: 评论