Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold?
Latch-free Synchronization in Database Systems: Silver Bullet or Fool's Gold?
复制标题
DOI：
--
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
Jose M. Faleiro;D. Abadi
中科院分区：
文献类型：
--
作者：
Jose M. Faleiro;D. Abadi
最近对多核数据库体系结构的研究提出了这样一种观点，即在可能的情况下，数据库系统应该放弃使用锁存器，而采用无锁存算法。基于锁存器的算法被认为可扩展性差，因为它们使用基于互斥的同步。相比之下，无锁存算法提供了强有力的理论保证，确保线程的进程永远不会由于其他线程的延迟或失败而受到阻碍。本文分析了影响无锁存和基于锁存的同步算法性能和可扩展性的各种因素，并对无锁存和基于锁存的同步算法进行了微基准测试。我们的发现表明，无锁存算法的上级可扩展性的论点比当前多核数据库架构的最新技术所表明的要微妙得多。
Recent research on multi-core database architectures has made the argument that, when possible, database systems should abandon the use of latches in favor of latch-free algorithms. Latch-based algorithms are thought to scale poorly due to their use of synchronization based on mutual exclusion . In contrast, latch-free algorithms make strong theoretical guarantees which ensure that the progress of a thread is never impeded due to the delay or failure of other threads. In this paper, we analyze the various factors that influence the performance and scalability of latch-free and latch-based algorithms, and perform a microbenchmark evaluation of latch-free and latch-based synchronization algorithms. Our findings indicate that the argument for latch-free algorithms’ superior scalability is far more nuanced than the current state-of-the-art in multi-core data-base architectures suggests.