关于transmittance存储中的部分等待自由
On Partial Wait-Freedom in Transactional Memory
摘要：
transmittance memory（TM）是一种方便的同步工具，它允许并发线程将共享数据上的指令序列声明为具有“全有或全无”语义的推测性\emph{transactions}。已知动态事务存储器不能提供\emph{wait-free}进程，因为每个事务在其自己的有限数目的步骤中提交。在本文中，我们探讨了只为\emph{subset}事务提供等待自由的成本。由于大多数事务性工作负载被认为是以读为主的，因此我们要求只读事务以无等待方式提交，而更新事务只有在没有并发的情况下运行时才能保证提交。我们表明，这种部分等待自由，结合有吸引力的要求，如读不可见性或不相交访问并行，会产生相当大的复杂性成本。
英文摘要：
Transactional memory (TM) is a convenient synchronization tool that allows concurrent threads to declare sequences of instructions on shared data as speculative \emph{transactions} with "all-or-nothing" semantics. It is known that dynamic transactional memory cannot provide \emph{wait-free} progress in the sense that every transaction commits in a finite number of its own steps. In this paper, we explore the costs of providing wait-freedom to only a \emph{subset} of transactions. Since most transactional workloads are believed to be read-dominated, we require that read-only transactions commit in the wait-free manner, while updating transactions are guaranteed to commit only if they run in the absence of concurrency. We show that this kind of partial wait-freedom, combined with attractive requirements like read invisibility or disjoint-access parallelism, incurs considerable complexity costs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
