Performance of multiversion concurrency control algorithms in maintaining temporal consistency
Performance of multiversion concurrency control algorithms in maintaining temporal consistency
复制标题
多版本并发控制算法在维护时间一致性方面的性能
DOI：
10.1109/cmpsac.1990.139341
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
J. Liu
中科院分区：
文献类型：
--
作者：
Xiaohui Song;J. Liu
作者提出了典型硬实时应用程序的模型以及实时事务访问的数据的年龄和分散性的概念。这些用于评估一类基于多版本锁的并发控制算法在实时共享数据环境中维护数据时间一致性的性能。结果表明，当冲突事务的周期长度接近时，这种并发控制算法更容易保持共享数据的时间一致性。事务的冲突模式对数据的时间不一致性的影响比系统的负载水平更显着。还希望交易周期在一个小范围内。当更快的事务具有更高的利用率时获得最好的情况。研究还表明，使用优先级继承原理和基于锁的并发控制算法可以减少事务的阻塞时间和访问时间不一致数据的事务数量以及最坏情况下的数据寿命和分散性。<<ETX>>
The authors present a model of typical hard real-time applications and the concepts of age and dispersion of data accessed by the real-time transactions. These are used to evaluate the performance of a class of multiversion lock-based concurrency control algorithms in maintaining temporal consistency of data in a real-time shared-data environment. It is shown that it is easier for such a concurrency control algorithm to maintain temporal consistency of shared data when the conflicting transactions are close in the lengths of their periods. The conflict pattern of the transactions has a more significant effect on the temporal inconsistency of data than the load level of the system. It is also desirable to have the transactions' periods within a small range. The best case was obtained when the faster transactions have higher utilizations. It was also shown that the use of the priority inheritance principle with the lock-based concurrency control algorithms can reduce transactions' blocking times and the number of transactions that access temporally inconsistent data as well as the worst-case age and dispersion of data.<<ETX>>