###
DOI:
Journal of Software:1992.3(1):17-22

无用操作对带约束的可串行化检验的影响
刘惟一
(云南大学 昆明; 650091)
THE INFLUENCE OF USELESS ACTIONS ON TESTING SERIALIZABILITY WITH CONSTRAINTS
Liu Weiyi
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2228   Download 2585
Received:January 07, 1990    Revised:June 04, 1990
> 中文摘要: 本文讨论“无用写”给调度的可串行化检验带来的影响,首先,我们定义了写—写、写—读、读—写和读—读约束,证明了在上述约束下,若不存在无用写,调度的可串行化检验的时间复杂性是多项式界的,进而将上述问题推广到多版本系统,得到一系列类似的有用的结论。
中文关键词:
Abstract:The influence of useless actions on testing serializability of a schedule is discussed in this paper. At first, we define the write-write^ write-read^ read-write and read-read constraints. It is shown that if there is no useless actions in the schedule, the complexity of testing serializability under the constraints is in polinomial time. We extend the problems to the multiversion systems, then some good conclusions polynomial are obtained.
keywords:
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Author NameAffiliation
Liu Weiyi 云南大学 昆明
650091 
Reference text:

刘惟一.无用操作对带约束的可串行化检验的影响.软件学报,1992,3(1):17-22

Liu Weiyi.THE INFLUENCE OF USELESS ACTIONS ON TESTING SERIALIZABILITY WITH CONSTRAINTS.Journal of Software,1992,3(1):17-22