| S.H.Son and R.P.Cook. (1989) Scheduling and consistency in real-time database systems, Proc. Sixth IEEE Workshop Real-Time Operating Systems and Software, pp.42-45. |
....may cause some tasks to miss their deadlines, and data values become out of date when they are not updated in time. 2) Even when all deadlines are met, preemption may cause the data read by tasks to be temporally inconsistent. 3) Concurrency control must be used to ensure data integrity [4,5,6,7]. With concurrency control in place, some tasks may be forced to wait for others to finish. They may read temporally inconsistent data or may simply not be able to produce their results on time. This paper studies the time characteristics of data for a class of hard real time applications that can ....
....can be characterized by the periodic job model [8] We extend this model by considering the time properties of the data accessed by each task. Based on this extended model, we evaluated the performance of two well known classes of concurrency control algorithms the pessimistic and optimistic [4,5,6,7] and two well known priority based preemptive scheduling algorithms the rate monotonic and earliest deadline first algorithms [8] in maintaining temporal consistency of data. Contrary to our intuition, we found that the optimistic concurrency control algorithm is generally poorer in their ....
[Article contains additional citation context not shown here]
S. H. Son and R. P. Cook. Scheduling and consistency in real-time database systems. In Proceedings of the 6th IEEE Workshop on Real-Time Operating Systems and Software, pages 42--45, May 1989.
No context found.
S.H.Son and R.P.Cook. (1989) Scheduling and consistency in real-time database systems, Proc. Sixth IEEE Workshop Real-Time Operating Systems and Software, pp.42-45.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC