arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.01018cs.DC
收藏

可分布线性化的数据结构

Distributionally Linearizable Data Structures

Dan Alistarh, Trevor Brown, Justin Kopinsky, Jerry Z. Li, Giorgi Nadiradze

摘要:

松弛并发数据结构由于其在图处理和机器学习应用中的可扩展性而变得越来越流行。尽管有相当大的兴趣,但存在自然的、高性能的随机化松弛并发数据结构的家族,例如用于实现松弛优先级队列数据结构的流行的MultiQueue模式,对于该模式,在并发设置中没有已知的保证。我们的主要贡献是在显示的第一次,根据一组分析假设,一个家庭的放松并发数据结构,包括变量的MultiCounter,但也是一个新的近似计数算法,我们称之为MultiCounter,提供了强有力的概率保证放松的程度相对于顺序规范,在任意并发执行。我们正式这些保证通过一个新的正确性条件称为分布式线性化,定制并发实现随机松弛。我们的研究结果是基于一个新的分析的经典的两个选择负载均衡算法的功率的异步变体,其中的位置选择可以基于不一致的,过时的信息(这个结果可能是独立的利益)。我们验证了我们的结果经验,表明MultiCounter算法可以实现可扩展的宽松的时间戳,这反过来又可以提高性能的经典TL2事务算法的3倍,为一些参数的设置。

英文摘要:

Relaxed concurrent data structures have become increasingly popular, due to their scalability in graph processing and machine learning applications. Despite considerable interest, there exist families of natural, high performing randomized relaxed concurrent data structures, such as the popular MultiQueue pattern for implementing relaxed priority queue data structures, for which no guarantees are known in the concurrent setting. Our main contribution is in showing for the first time that, under a set of analytic assumptions, a family of relaxed concurrent data structures, including variants of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter, provides strong probabilistic guarantees on the degree of relaxation with respect to the sequential specification, in arbitrary concurrent executions. We formalize these guarantees via a new correctness condition called distributional linearizability, tailored to concurrent implementations with randomized relaxations. Our result is based on a new analysis of an asynchronous variant of the classic power-of-two-choices load balancing algorithm, in which placement choices can be based on inconsistent, outdated information (this result may be of independent interest). We validate our results empirically, showing that the MultiCounter algorithm can implement scalable relaxed timestamps, which in turn can improve the performance of the classic TL2 transactional algorithm by up to 3 times, for some settings of parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑