Real-time data semantics and similarity-based concurrency control
Journal
IEEE Transactions on Computers
Journal Volume
49
Journal Issue
11
Pages
1241-1254
Date Issued
2000
Author(s)
Mok, A.K.
Abstract
This paper formalizes the concept of similarity which has been used on an ad hoc basis by application engineers to provide more flexibility in concurrency control. We show how the usual correctness criteria of concurrency control, namely, final-state, view, and conflict serializability, can be weakened to incorporate similarity. We extend the weakened correctness criteria in <16] for real-time applications which may run continually, have concurrent transaction executions, or skip unimportant computations. A semantic approach based on the similarity concept is then taken to propose a sufficient condition for scheduling real-time transactions without locking of data.
Other Subjects
Concurrency control; Data structures; Parallel processing systems; Scheduling; Semantics; Theorem proving; Schedule correctness; Serializability; Similarity; Database systems
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
02.pdf
Size
233.94 KB
Format
Adobe PDF
Checksum
(MD5):f2dd61be6955d8449bd22ab89c507673