使用跳跃图增加NUMA局部性
Using Skip Graphs for Increased NUMA Locality
摘要:
我们提出了一个数据分区技术执行跳过图,促进显着的数量和质量上的改进NUMA本地并发数据结构,以及减少争用。我们建立在以前的线程本地索引和懒惰的技术,并在一个高层次上,我们的设计包括一个分区跳过图,以及与线程本地顺序映射集成,无争用操作。作为概念验证,我们使用我们的技术实现了映射和放松优先级队列ADT。地图的构思使用懒惰和非懒惰的方法插入和删除,我们的实现被证明是具有竞争力的国家的最先进的地图。我们观察到CAS局部性提高了6倍,远程CAS操作的数量减少了68.6%,并且与控制跳过列表相比,使用懒惰跳过图时CAS成功率从88.3%增加到99%(受相同的代码库,优化和实现实践的影响)。从质量上讲,远程内存访问不仅在数量上减少,而且线程之间的NUMA距离越大,减少的越多。我们考虑两种替代实现的放松的优先级队列,进一步利用我们的数据分区跳过图:(a)使用“spraying”,一个众所周知的随机游走技术通常执行跳过列表,但现在执行跳过图;和(b)一个自定义协议,遍历跳过图确定性,沿此遍历标记元素。我们提供了正式的参数,表明第一种方法是更多的\emph{relaxed},也就是说,删除键的跨度较大,而第二种方法有较小的竞争。实验结果表明,基于喷涂的方法在跳跃图上表现更好,但两者似乎都可以适当地扩展。
英文摘要:
We present a data partitioning technique performed over skip graphs that promotes significant quantitative and qualitative improvements on NUMA locality in concurrent data structures, as well as reduced contention. We build on previous techniques of thread-local indexing and laziness, and, at a high level, our design consists of a partitioned skip graph, well-integrated with thread-local sequential maps, operating without contention. As a proof-of-concept, we implemented map and relaxed priority queue ADTs using our technique. Maps were conceived using lazy and non-lazy approaches to insertions and removals, and our implementations are shown to be competitive with state-of-the-art maps. We observe a 6x higher CAS locality, a 68.6% reduction on the number of remote CAS operations, and a increase from 88.3% to 99% CAS success rate when using a lazy skip graph as compared to a control skip list (subject to the same codebase, optimizations, and implementation practices). Qualitatively speaking, remote memory accesses are not only reduced in number, but the larger the NUMA distance between threads, the larger the reduction is. We consider two alternative implementations of relaxed priority queues that further take advantage of our data partitioning over skip graphs: (a) using ``spraying'', a well-known random-walk technique usually performed over skip lists, but now performed over skip graphs; and (b) a custom protocol that traverses the skip graph deterministically, marking elements along this traversal. We provide formal arguments indicating that the first approach is more \emph{relaxed}, that is, that the span of removed keys is larger, while the second approach has smaller contention. Experimental results indicate that the approach based on spraying performs better on skip graphs, yet both seem to scale appropriately.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。