在多版本transmitted存储系统中实现无饥饿
Achieving Starvation-Freedom in Multi-Version Transactional Memory Systems
摘要：
软件事务存储器系统（STM）作为解决多核系统中的多线程编程的同步和并发问题的优雅替代方案已经引起了极大的兴趣。客户端程序通过发出事务来使用STM。STM确保事务要么提交要么中止。由于冲突而中止的事务通常会重新发出，并期望它在后续的化身中成功完成。然而，许多现有的STM不能提供饥饿自由，即，在这些系统中，并发冲突可能会阻止具体化事务的提交。为了克服这一局限性，我们系统地推导出一种新的饥饿免费算法的多版本STM。我们的算法既可以用于版本数无限且使用垃圾回收的情况，也可以用于仅维护最新的K个版本的情况。我们已经证明，我们提出的算法比现有的最先进的STM表现更好。
英文摘要：
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. Client programs use STMs by issuing transactions. STM ensures that transaction either commits or aborts. A transaction aborted due to conflicts is typically re-issued with the expectation that it will complete successfully in a subsequent incarnation. However, many existing STMs fail to provide starvation freedom, i.e., in these systems, it is possible that concurrency conflicts may prevent an incarnated transaction from committing. To overcome this limitation, we systematically derive a novel starvation free algorithm for multi-version STM. Our algorithm can be used either with the case where the number of versions is unbounded and garbage collection is used or where only the latest K versions are maintained, KSFTM. We have demonstrated that our proposed algorithm performs better than existing state-of-the-art STMs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
