多核架构下并行分布扫描框架的实证评估
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
摘要：
在本文中，我们进行了实证评估的并行外部存储器（PEM）模型的背景下，几何问题。特别是，我们实现了Ajwani，Sitchinava和Zeh的并行分布扫描框架来解决批量1维穿刺最大值问题。虽然现代处理器由复杂的内存系统（多级缓存，设置关联性，TLB，预取），我们经验表明，算法设计在简单的模型，专注于最大限度地减少共享内存和单级缓存之间的I/O传输，可以导致有效的软件在当前的多核架构。我们的实现具有显着减少访问缓慢的DRAM，因此，优于传统的方法，基于平面扫描和双向分而治之。
英文摘要：
In this paper, we perform an empirical evaluation of the Parallel External Memory (PEM) model in the context of geometric problems. In particular, we implement the parallel distribution sweeping framework of Ajwani, Sitchinava and Zeh to solve batched 1-dimensional stabbing max problem. While modern processors consist of sophisticated memory systems (multiple levels of caches, set associativity, TLB, prefetching), we empirically show that algorithms designed in simple models, that focus on minimizing the I/O transfers between shared memory and single level cache, can lead to efficient software on current multicore architectures. Our implementation exhibits significantly fewer accesses to slow DRAM and, therefore, outperforms traditional approaches based on plane sweep and two-way divide and conquer.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
