面向STM的松弛存储一致性算法  

A Relaxed Memory Consistency Algorithm for STM

作　　者：张小强[1] 彭林[1] 黄春[1] 谢伦国[1] 

机构地区：[1]国防科学技术大学计算机学院,湖南长沙410073

出　　处：《计算机工程与科学》2010年第1期127-131,共5页Computer Engineering & Science

基　　金：国家863计划资助项目(2008AA01Z110);国家自然科学基金资助项目(60676010)

摘　　要：软件事务性内存(STM)提供同步手段,让多线程程序高效并发执行。如果两个事务访问了同一个共享数据且至少一个事务进行了修改操作,则称发生了冲突。检测冲突后,一般选择一个事务终止。当前的STM实现都基于严格的线性一致性(Linearizability)语义模型,实现简单。但是,基于该语义会导致很多本来可以完成提交的事务失败,降低了系统效率。把因果一致性模型应用于STM,可以在保证程序准确性条件下取得较好的实际性能。实验数据表明,该算法简单高效,明显减少了冲突数目。Software transactional memory （STM） systems use lightweight and in-memory software transactions to address concurrency in multi-threaded applications, ensuring the safety at all times. Two concurrent transactions cause conflict if they access the same object and at least one of them modifies that object. When an STM system identifies a conflict, it typically allows one transaction to continue, and delays or aborts the other. The current implementation of transactional memories （TMs） has the advantage of being simple and efficient, and providing strong linearizability semantics. But in many applications, enforcing a strict linearizability consistency policy over the entire read-set of a transaction can lead to a large number of unnecessary aborts. In this paper, we investigate the use of Causal Consistency with weaker semantics, which provides a good trade-off between strong semantics and good practical performance even for long transactions. The experimental results show that the implementation is simple, and substantially reduces the number of conflicts.

关 键 词：软件事务性内存(STM) 因果一致性 验证 并发 多线程 

分 类 号：TP314[自动化与计算机技术—计算机软件与理论]