分片消除与结合用于高效率的并发栈
Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks
AI总结：
该研究提出了一种基于分片和fetch&increment的高效并发栈实现，通过新颖的消除机制和结合方法，在高并发场景下显著提升了性能。
摘要：
我们提出了一种新的阻塞线性可实现的栈实现，该实现利用分片和fetch&increment技术，实现了比现有所有并发栈显著更好的性能。所提出的实现基于一种新颖的消除机制和一种新的结合方法，这两种方法被高效结合以获得高性能。我们的实现增强了对共享栈的并行性，并在访问共享栈时降低了竞争。实验表明，所提出的栈实现在大多数工作负载中比现有所有并发栈快最多2倍。它在支持大量线程的系统和高竞争场景中尤其高效。
英文摘要：
We present a new blocking linearizable stack implementation which utilizes sharding and fetch&increment to achieve significantly better performance than all existing concurrent stacks. The proposed implementation is based on a novel elimination mechanism and a new combining approach that are efficiently blended to gain high performance. Our implementation results in enhanced parallelism and low contention when accessing the shared stack. Experiments show that the proposed stack implementation outperforms all existing concurrent stacks by up to 2X in most workloads. It is particularly efficient in systems supporting a large number of threads and in high contention scenarios.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
