权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

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

Kala：适用于并发系统的高效且可扩展的时间旅行基础设施

基本信息

批准号：
0701832
负责人：
Suresh Jagannathan
金额：
$ 32.5万
依托单位：
Purdue University
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2007
资助国家：
美国
起止时间：
2007-09-01 至 2011-08-31
项目状态：
已结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=0701832&HistoricalAwards=false
关键词：
Kala Efficient Scalable Time Travel

项目摘要

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.

Kala：一种用于并发系统的高效且可扩展的时间旅行基础设施Suresh Jaganan研究了时间旅行的概念，即实现将并发计算恢复到可替代的可行全局状态的能力。最近关于软件事务或投机性执行的工作提供了一种受限的时间旅行形式：当事务由于违反可串行化而中止时，该事务的影响被恢复。同样，如果检测到违反数据依赖关系，则可以撤消推测线程的影响。然而，规定事务或投机性操作何时必须中止以及计算在何处恢复的策略是非常严格的，程序员没有指定，并且经常被过度约束。时间旅行和撤销对编程语言设计和规范、编译器分析和运行时实现的更广泛的分支是本研究的重点。对时间旅行的有效支持可以为并发编程实现许多新的编程抽象。这项研究需要开发基于程序员指定的不变量来恢复计算的抽象、定义用于指导撤销策略的程序状态之间的关系的规范技术、识别状态之间的等价性的静态分析、以及允许高效地恢复控制和状态的编译器和运行时结构。