一种动态消元-组合叠加算法
A Dynamic Elimination-Combining Stack Algorithm
摘要:
构造可扩展并发数据结构的两个关键同步范例是软件合并和消除。基于消除的并发数据结构允许具有反向语义的操作(诸如压栈和弹出栈操作)“碰撞”和交换值,而不必访问中心位置。另一方面,当冲突操作具有相同的语义时,软件组合是有效的:当执行具有相同语义的操作的一对线程冲突时,执行组合的操作集合的任务被委托给线程之一,并且另一个线程等待其操作被执行。迭代应用此机制可以减少内存争用并提高吞吐量。最高可扩展性的现有并发堆栈算法是消除退避堆栈。消除回退堆栈为对称工作负载提供了高并行性,其中推操作和弹出操作的数量大致相等,但当工作负载不对称时,其性能会恶化。我们提出了DECS,一种新的动态消除组合堆栈算法,以及所有的工作负载类型的规模。在保持消除bakcoff堆栈的简单性和低开销的同时,DECS设法从相同和反向语义操作的冲突中受益。我们的经验评估表明,DECS规模显着优于阻塞和非阻塞最佳先验堆栈算法。
英文摘要:
Two key synchronization paradigms for the construction of scalable concurrent data-structures are software combining and elimination. Elimination-based concurrent data-structures allow operations with reverse semantics (such as push and pop stack operations) to "collide" and exchange values without having to access a central location. Software combining, on the other hand, is effective when colliding operations have identical semantics: when a pair of threads performing operations with identical semantics collide, the task of performing the combined set of operations is delegated to one of the threads and the other thread waits for its operation(s) to be performed. Applying this mechanism iteratively can reduce memory contention and increase throughput. The most highly scalable prior concurrent stack algorithm is the elimination-backoff stack. The elimination-backoff stack provides high parallelism for symmetric workloads in which the numbers of push and pop operations are roughly equal, but its performance deteriorates when workloads are asymmetric. We present DECS, a novel Dynamic Elimination-Combining Stack algorithm, that scales well for all workload types. While maintaining the simplicity and low-overhead of the elimination-bakcoff stack, DECS manages to benefit from collisions of both identical- and reverse-semantics operations. Our empirical evaluation shows that DECS scales significantly better than both blocking and non-blocking best prior stack algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。