咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
Efficient parallel Reinforcement Learning Framework Using the Reactor Model  24
Efficient Parallel Reinforcement Learning Framework Using th...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Kwok, Jacky Lohstroh, Marten Lee, Edward A. Univ Calif Berkeley Berkeley CA 94720 USA
parallel Reinforcement Learning (RL) frameworks are essential for mapping RL workloads to multiple computational resources, allowing for faster generation of samples, estimation of values, and policy improvement. Thes... 详细信息
来源: 评论
A Simpler and parallelizable O(√log n)-approximation Algorithm for SPARSEST CUT  24
A Simpler and Parallelizable O(√log n)-approximation Algori...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Kolmogorov, Vladimir Inst Sci & Technol Austria ISTA Klosterneuburg Austria
Currently, the best known tradeoff between approximation ratio and complexity for the Sparsest Cut problem is achieved by the algorithm in [Sherman, FOCS 2009]: it computes O(root(log n)/epsilon)-approximation using O... 详细信息
来源: 评论
Fault-Tolerant parallel Integer Multiplication  24
Fault-Tolerant Parallel Integer Multiplication
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Nissim, Roy Schwartz, Oded Spiizer, Yuval Hebrew Univ Jerusalem Dept Comp Sci Jerusalem Israel
Exascale machines have a small mean time between failures, necessitating fault tolerance. Out-of-the-box fault-tolerant solutions, such as checkpoint-restart and replication, apply to any algorithm but incur significa... 详细信息
来源: 评论
SPAA 2024 - proceedings of the 36th acm symposium on parallelism in algorithms and architectures
SPAA 2024 - Proceedings of the 36th ACM Symposium on Paralle...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures, SPAA 2024
The proceedings contain 54 papers. The topics discussed include: expediting hazard pointers with bounded RCU critical sections;Alock: asymmetric lock primitive for RDMA systems;when is parallelism fearless and zero-co...
来源: 评论
Scheduling Jobs with Work-Inefficient parallel Solutions  24
Scheduling Jobs with Work-Inefficient Parallel Solutions
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Kuszmaul, William Westover, Alek Harvard Univ Cambridge MA 02138 USA MIT Cambridge MA USA
This paper introduces the serial-parallel decision problem. Consider an online scheduler that receives a series of tasks, where each task has both a parallel and a serial implementation. The parallel implementation ha... 详细信息
来源: 评论
Massively parallel algorithms for Approximate Shortest Paths  24
Massively Parallel Algorithms for Approximate Shortest Paths
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Dory, Michal Matar, Shaked Univ Haifa Haifa Israel Ben Gurion Univ Negev Beer Sheva Israel
We present fast algorithms for approximate shortest paths in the massively parallel computation (MPC) model. We provide randomized algorithms that take poly(log log n) rounds in the near-linear memory MPC model. Our r... 详细信息
来源: 评论
Brief Announcement: Work Stealing through Partial Asynchronous Delegation  24
Brief Announcement: Work Stealing through Partial Asynchrono...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Wang, Jiawei Liu, Yutao Fu, Ming Haertig, Hermann Chen, Haibo Tech Univ Dresden Huawei Dresden Res Ctr Dresden Germany Huawei Dresden Res Ctr Dresden Germany Huawei Cent Software Inst Shenzhen Peoples R China Tech Univ Dresden Dresden Germany Shanghai Jiao Tong Univ Huawei Cent Software Inst Shanghai Peoples R China
Work stealing is a well-established technique in multi-core systems that aims to improve load balancing and task scheduling efficiency. Each processing unit maintains its own task queue, and when idle, it steals tasks... 详细信息
来源: 评论
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs  24
Brief Announcement: Red-Blue Pebbling with Multiple Processo...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Boehnlein, Toni Papp, Pal Andras Yzelman, Albert-Jan N. Huawei Zurich Res Ctr Comp Syst Lab Zurich Switzerland
The well-studied red-blue pebble game models the execution of an arbitrary computational DAG by a single processor over a two-level memory hierarchy. We present a natural generalization to a multiprocessor setting whe... 详细信息
来源: 评论
POSTER: Minimizing speculation overhead in a parallel recognizer for regular texts  30
POSTER: Minimizing speculation overhead in a parallel recogn...
收藏 引用
30th symposium on Principles and Practice of parallel Programming
作者: Borsotti, Angelo Breveglieri, Luca Morzenti, Angelo Reghizzi, Stefano Crespi Politecn Milan Milan Italy CNR IEIIT Milan Italy
Speculative data-parallel algorithms for language recognition have been widely experimented for various types of finite-state automata (FA), deterministic (DFA) and nondeterministic (NFA), often derived from regular e... 详细信息
来源: 评论
The All Nearest Smaller Values Problem Revisited in Practice, parallel and External Memory  24
The All Nearest Smaller Values Problem Revisited in Practice...
收藏 引用
36th acm symposium on parallelism in algorithms and architectures (SPAA)
作者: Sitchinava, Nodari Svenning, Rolf Univ Hawaii Manoa Honolulu HI 96822 USA Aarhus Univ Aarhus Denmark
We present a thorough investigation of the All Nearest Smaller Values (ANSV) problem from a practical perspective. The ANSV problem is defined as follows: given an array A consisting of n values, for each entry A(i) c... 详细信息
来源: 评论