By Topic

How well can data temporal consistency be maintained?

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Song, X. ; Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA ; Liu, J.W.S.

A model of hard real-time systems where tasks access shared data is presented, and temporal consistency is defined in terms of the age and dispersion of data. Based on this model, two variants of a multiversion lock-based concurrency control algorithm and two priority-driven preemptive scheduling algorithms, rate-monotone and earliest-deadline-first, are evaluated. Simulation results indicate how well data temporal consistency is maintained for different workload characteristics. These results can be used to guide the design of applications; by avoiding undesirable parameters, it is made easier to maintain data temporal consistency

Published in:

Computer-Aided Control System Design, 1992. (CACSD), 1992 IEEE Symposium on

Date of Conference:

17-19 Mar 1992