咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是1361-1370 订阅
排序:
A no-busy-wait balanced tree parallel algorithmic paradigm  00
A no-busy-wait balanced tree parallel algorithmic paradigm
收藏 引用
Proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Uzi Vishkin University of Maryland
Suppose that a parallel algorithm can include any number of parallel threads. Each thread can proceed without ever having to busy wait to another thread. A thread can proceed till its termination, but no new threads c...
来源: 评论
A quantitative approach for teaching parallel computing  92
A quantitative approach for teaching parallel computing
收藏 引用
Proceedings of the twenty-third SIGCSE technical symposium on Computer science education
作者: E. Luque R. Suppi J. Sorribes Department d'Informàtica Universitat Autònoma de Barcelona 08193-Bellaterra Barcelona Spain
parallel computing teaching has an important difficulty, there are few tools to directly learn the behavior of the parallel algorithms and the parallel architectures. Normally the student is formed to think in sequent...
来源: 评论
Software pipelining loops with conditional branches  29
Software pipelining loops with conditional branches
收藏 引用
IEEE/acm International symposium on Microarchitecture (MICRO)
作者: M.G. Stoodley C.G. Lee Department of Electrical and Computer Engineering University of Toronto Toronto ONT Canada
Software pipelining is an aggressive scheduling technique that generates efficient code for loops and is particularly effective for VLIW architectures. Few software pipelining algorithms, however, are able to efficien... 详细信息
来源: 评论
Dynamic scheduling on parallel machines
Dynamic scheduling on parallel machines
收藏 引用
annual IEEE symposium on Foundations of Computer Science
作者: S. Feldmann J. Sgall S.-H. Teng School of Computer Science Carnegie Mellon University Pittsburgh PA USA Xerox-PARC Palo Alto CA USA
The problem of online job scheduling on various parallel architectures is studied. An O((log log n)/sup 1/2/)-competitive algorithm for online dynamic scheduling on an n*n mesh is given. It is proved that this algorit... 详细信息
来源: 评论
Safe Nondeterminism in a Deterministic-by-Default parallel Language  11
Safe Nondeterminism in a Deterministic-by-Default Parallel L...
收藏 引用
38th symposium on Principles of Programming Languages
作者: Bocchino, Robert L., Jr. Heumann, Stephen Honarmand, Nima Adve, Sarita V. Adve, Vikram S. Welc, Adam Shpeisman, Tatiana Carnegie Mellon Univ Pittsburgh PA 15213 USA
A number of deterministic parallel programming models with strong safety guarantees are emerging, but similar support for non-deterministic algorithms, such as branch and bound search, remains an open question. We pre... 详细信息
来源: 评论
ParGeo: A Library for parallel Computational Geometry  30
ParGeo: A Library for Parallel Computational Geometry
收藏 引用
30th annual European symposium on algorithms, ESA 2022
作者: Wang, Yiqiu Yesantharao, Rahul Yu, Shangdi Dhulipala, Laxman Gu, Yan Shun, Julian CSAIL MIT CambridgeMA United States University of Maryland College ParkMD United States University of California RiversideCA United States
This paper presents ParGeo, a multicore library for computational geometry. ParGeo contains modules for fundamental tasks including kd-tree based spatial search, spatial graph generation, and algorithms in computation... 详细信息
来源: 评论
Sequential and parallel algorithms to find a K5 minor  92
Sequential and parallel algorithms to find a K5 minor
收藏 引用
Proceedings of the third annual acm-SIAM symposium on Discrete algorithms
作者: André Kézdy Patrick McGuinness
来源: 评论
Online Scheduling with General Cost Functions  12
Online Scheduling with General Cost Functions
收藏 引用
annual acm-Society for Industrial and Applied Mathmatics symposium on Discrete algorithms
作者: Sungjin Im Benjamin Moseley Kirk Pruhs Department of Computer Science University of Illinois Computer Science Department University of Pittsburgh
One obvious question is if there exists an online algorithm that is O(1)-competitive with speed less than two or not. To obtain such an algorithm (if exists), one must exploit the structure of cost functions. Our anal... 详细信息
来源: 评论
FPGA Architecture of Generalized Laguerre-Volterra MIMO Model for Neural Population Spiking Activities
FPGA Architecture of Generalized Laguerre-Volterra MIMO Mode...
收藏 引用
IEEE 19th annual International symposium on Field-Programmable Custom Computing Machines (FCCM)
作者: Li, Will X. Y. Cheung, Ray C. C. Zhang, Wei Chan, Rosa H. M. Song, Dong Berger, Theodore W. City Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China Univ So Calif Dept Biomed Engn Los Angeles CA 90007 USA
We present a parallelized and pipelined architecture for a generalized Laguerre-Volterra MIMO system to identify the time-varying neural dynamics underlying spike activities. The proposed architecture consists of a fi... 详细信息
来源: 评论
Time-work tradeoffs for parallel graph algorithms  91
Time-work tradeoffs for parallel graph algorithms
收藏 引用
Proceedings of the second annual acm-SIAM symposium on Discrete algorithms
作者: Thomas H. Spencer Computer Science Department Rensselaer Polytechnic Institute
来源: 评论