Kala: An Efficient and Scalable Time Travel Infrastructure for Concurrent Systems

0701832 Jagannathan，SureshPurdue大学Kala：一个有效的和可扩展的时间旅行基础设施的并发系统Suresh Jagananthan时间旅行的概念，一个实现的能力，以恢复一个并发计算到一个替代的可行的全局状态进行了研究。 最近对软件事务或推测执行的研究提供了一种受约束的时间旅行形式：当事务由于违反可串行性而中止时，事务的效果被恢复。 类似地，如果检测到数据依赖违反，则可以撤销推测线程的影响。 然而，政策，规定当一个交易或投机行为必须中止，计算恢复，是非常严格的，不指定的程序员，往往over-constrained.The更广泛的分歧的时间旅行和撤销编程语言的设计和规范，编译器分析，和运行时实现是本研究的重点。 对时间旅行的有效支持可以为并发编程提供许多新的编程抽象。 这项研究需要开发的抽象，恢复计算程序员指定的不变量的基础上，规范技术，定义用于指导撤销策略，静态分析，确定状态之间的等价关系，编译器和运行时结构，使有效的逆转控制和状态的程序状态之间的关系。

0701832Jagannathan, SureshPurdue UniversityKala: An Efficient and Scalable Time Travel Infrastructure for Concurrent Systems Suresh JagananthanThe notion of time travel, the ability of an implementation to revert a concurrent computation to an alternative feasible global state is investigated. Recent work on software transactions or speculative execution provide a constrained form of time-travel: when a transaction aborts due to a serializability violation, the transaction's effects are reverted. Similarly, the effects of a speculative thread can be undone if data dependency violations are detected. However, the policies that dictate when a transaction or a speculative action must abort, and where computation resumes, are very rigid, are not specified by the programmer, and often over-constrained.The broader ramifications of time travel and revocation on programming language design and specification, compiler analysis, and runtime implementation is the focus of this research. Effective support for time travel can enable a number of new programming abstractions for concurrent programming. This research entails the development of abstractions that revert computation based on programmer-specified invariants, specification techniques that define relations among program states used to guide revocation strategies, static analyses that identify equivalences among states, and compiler and runtime structures to enable efficient reversion of control and state.