Atomic Transactional Execution in Hardware: A New High-Performance Abstraction for Databases?
Atomic Transactional Execution in Hardware: A New High-Performance Abstraction for Databases?
复制标题
硬件中的原子事务执行：数据库的新高性能抽象？
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
P. Bernstein
中科院分区：
文献类型：
--
作者：
Ravi Rajwar;P. Bernstein
硬件技术的进步对未来的数据库系统设计具有深刻的影响[1]。增加的晶体管密度，更快的处理器，较大的记忆和片间通信潜伏期较低，已经使新的硬件机制（例如支持投机执行，大型芯片缓冲和具有cache cache cooherence的积极的多处理器系统组织）提供了新的硬件机制。结果，现代处理器中现在存在的大部分实施硬件交易所需的支持。本文讨论了这样的建议。它基于一种称为交易锁的硬件机制[2]（TLR），该机制最初旨在以无锁的方式通过基于锁的基于锁的多线程程序来支持关键部分的原子能执行。在本文中，我们解释了该机制，并建议如何使用它来控制数据库系统中交易的原子执行。
Advances in hardware technology have deep implications on future database system designs [1]. Increasing transistor densities, faster processors, larger memories, and low inter-chip communication latencies have enabled new hardware mechanisms such as processors supporting speculative execution, large on-chip buffering, and aggressive multiprocessor system organizations with cache coherence. As a result, much of the support required to implement hardware transactions is now either present in modern processors or their implementations are well understood. This paper discusses one such proposal. It is based on a hardware mechanism called Transactional Lock Removal [2] (TLR), which was originally designed to support the atomic execution of critical sections by a lock-based multithreaded program in a lock-free manner. In this paper, we explain the mechanism and suggest how it could be used to control the atomic execution of transactions in a database system.