Abstract { We study the performance of concurrency control algorithms in maintaining temporal consistency of shared data in hard real-time systems. In our model, a hard real-time system consists of periodic tasks which are either write-only, read-only or update transactions. Transactions may share data. Data objects are temporally inconsistent when their ages and dispersions are greater than the absolute and relative thresholds allowed by the application. Real-time transactions must read temporally consistent data in order to deliver correct results. Based on this model, we have evaluated the performance of two well-known classes of concurrency control algorithms that handle multiversion data: the two-phase locking and the optimistic algorithms, as well as the rate-monotonic and earliest-deadline-rst scheduling algorithms. The e ects of using the priority inheritance and stack-based protocols with lock-based concurrency control are also studied.
In the model introduced in REF , a real-time system consists of periodic tasks which are either read-only, write-only or update (read-write) transactions.
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
IEEE Trans. Knowl. Data Eng.
IEEE Trans. Knowl. Data Eng.
Computer Science