On ordering transaction commit

On ordering transaction commit
复制标题

提交订单交易时

DOI:
--
复制
发表时间:
2016
期刊:
ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming
影响因子:
--
通讯作者:
B. Ravindran
B. Ravindran
中科院分区:
--
文献类型:
--
作者:
Mohamed M. Saad;R. Palmieri;B. Ravindran

文献摘要

被引文献

相似文献

在这篇海报论文中,我们简要介绍了一个有效的解决方案,以解决强制执行预定义顺序的提交事务的问题。要做到这一点,我们概述了两个算法的设计,部署了一个合作的事务执行,规避了事务隔离约束,有利于传播写的值之间的冲突事务。初步实施表明,即使在存在数据冲突,所提出的算法优于其他竞争对手,显着。
In this poster paper, we briefly introduce an effective solution to address the problem of committing transactions enforcing a predefined order. To do that, we overview the design of two algorithms that deploy a cooperative transaction execution that circumvents the transaction isolation constraint in favor of propagating written values among conflicting transactions. A preliminary implementation shows that even in the presence of data conflicts, the proposed algorithms outperform other competitors, significantly.