计算机科学
并行计算
分拆(数论)
隐藏物
并发
算法
缓存不经意算法
共享内存
并行算法
CPU缓存
划分问题
缓存算法
分布式计算
数学
组合数学
作者
William Kuszmaul,Alek Westover
标识
DOI:10.1145/3350755.3400234
摘要
We present an in-place algorithm for the parallel-partition problem with linear work and polylogarithmic span. The algorithm uses only exclusive read/write shared variables and can be implemented using parallel-for-loops without any additional concurrency considerations (i.e., the algorithm is EREW). A key feature of the algorithm is that it exhibits provably optimal cache behavior up to small-order factors.
科研通智能强力驱动
Strongly Powered by AbleSci AI