[论文解读] Starvation Freedom in Multi-Version Transactional Memory Systems

Ved Prakash Chaudhary, Sandeep S. Kulkarni+2 more|arXiv (Cornell University)|Sep 4, 2017

Distributed systems and fault tolerance参考文献 22被引用 2

一句话总结

该论文提出了KSFTM，这是首个支持每个事务对象K个版本（K为可配置参数）的多版本软件事务内存（STM）系统，保证了饥饿消除。该算法通过使用动态、公平的调度机制，防止高优先级事务因执行缓慢而阻塞其他事务，从而在并发、多核环境中实现正确性与饥饿消除。

ABSTRACT

Software Transactional Memory systems (STMs) have garnered significant interest as an elegant alternative for addressing synchronization and concurrency issues with multi-threaded programming in multi-core systems. In order for STMs to be efficient, they must guarantee some progress properties. This work explores the notion of starvation-freedom in Software Transactional Memory Systems (STMs). An STM system is said to be starvation-free if every thread invoking a transaction gets opportunity to take a step (due to the presence of a fair scheduler) then the transaction will eventually commit. A few starvation-free algorithms have been proposed in the literature in the context of single-version STM Systems. These algorithm work on the basis of priority. But the drawback with this approach is that if a set of high-priority transactions become slow then they can cause several other transactions to abort. Multi-version STMs maintain multiple-versions for each transactional object or t-object. By storing multiple versions, these systems can achieve greater concurrency. In this paper, we propose a multi-version starvation free STM, KSFTM, which as the name suggests achieves starvation freedom while storing K versions of each t-object. Here K is an input parameter fixed by the application programmer depending on the requirement. Our algorithm is dynamic which can support different values of K ranging from 1 to infinity . If K is infinity then there is no limit on the number of versions. But a separate garbage-collection mechanism is required to collect unwanted versions. On the other hand, when K is 1, it becomes same as a single-version STM system. We prove the correctness and starvation-freedom property of the proposed KSFTM algorithm. To the best of our knowledge, this is the first multi-version STM system that is correct and satisfies starvation-freedom as well.

研究动机与目标

• 解决现有多版本STM系统中缺乏饥饿消除的问题，该问题可能导致事务无限期中止。
• 设计一种支持任意版本数（K从1到无穷）的动态STM算法，根据应用需求灵活调整。
• 确保在公平调度器下，无论优先级高低，每个事务最终都能提交，从而消除饥饿。
• 在多版本STM背景下，正式证明正确性与饥饿消除，填补先前研究的空白。

提出的方法

• KSFTM维护每个事务对象的K个版本，支持并发读写而无需阻塞。
• 采用动态版本化机制，根据系统负载和应用需求自适应调整K值。
• 公平调度机制确保即使高优先级事务执行缓慢，也不会导致任何事务被无限期延迟。
• 算法采用基于优先级的版本选择与冲突解决机制，但同时提供公平性保证以防止饥饿。
• 当K为有限值时，使用独立的垃圾回收机制回收过时版本。
• 通过版本化读写操作确保原子性与隔离性，提交决策基于版本一致性检查。

实验结果

研究问题

• RQ1 能否设计一种多版本STM系统，在支持动态版本数的同时保证饥饿消除？
• RQ2 如何在不完全依赖优先级机制的前提下，确保版本选择与事务执行的公平性？
• RQ3 K值（版本数量）的变化对系统吞吐量和事务执行公平性有何影响？
• RQ4 是否可能在不限制版本数量上限的前提下，维持多版本STM的正确性与饥饿消除？
• RQ5 与单版本无饥饿STM相比，所提出的算法在并发性与进度保证方面表现如何？

主要发现

• KSFTM是首个被证明既正确又无饥饿的多版本STM系统，填补了文献中的关键空白。
• 该算法支持从1到无穷的动态K值，允许根据应用需求灵活调整版本化开销与并发性。
• 当K = 1时，KSFTM退化为单版本STM，保持向后兼容性。
• 在公平调度器下，即使高优先级事务执行缓慢，系统也能确保每个事务最终提交。
• 当K为有限值时，需使用独立的垃圾回收机制管理过时版本，防止内存无限制增长。
• 已建立形式化正确性与无饥饿性证明，证实该算法在并发、多核环境下的可靠性。