TSO记忆模型上活性的判定性
Decidability of Liveness on the TSO Memory Model
摘要:
并发对象的一个重要属性是它们是否支持进度--一种特殊的活动保证,它确保在系统公平性假设下终止单个方法调用。已经提出了并发对象的活性属性。典型的活性特性包括无锁定、无等待、无死锁、无饥饿和无阻塞。已知上述五个活性性质在序列一致性(SC)记忆模型上对于有限数目的进程是可判定的。然而,在松弛内存模型上运行的有限状态并发程序的活性的可判定性问题仍然是开放的。在本文中,我们解决这个问题的总存储顺序(TSO)的内存模型,发现在x86架构。我们证明了对于有限数目的进程,锁自由、等待自由、死锁自由和饥饿自由在TSO上是不可判定的,而障碍自由是可判定的。
英文摘要:
An important property of concurrent objects is whether they support progress -a special case of liveness-guarantees, which ensure the termination of individual method calls under system fairness assumptions. Liveness properties have been proposed for concurrent objects. Typical liveness properties includelock-freedom,wait-freedom,deadlock-freedom,starvation-freedom and obstruction-freedom. It is known that the five liveness properties above are decidable on the Sequential Consistency (SC) memory model for a bounded number of processes. However, the problem of decidability of liveness for finite state concurrent programs running on relaxed memory models remains open. In this paper we address this problem for the Total Store Order (TSO) memory model,as found in the x86 architecture. We prove that lock-freedom, wait-freedom,deadlock-freedom and starvation-freedom are undecidable on TSO for a bounded number of processes, while obstruction-freedom is decidable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。