DocumentCode :
1644885
Title :
How well can data temporal consistency be maintained?
Author :
Song, Xiaohui ; Liu, Jane W S
Author_Institution :
Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA
fYear :
1992
Firstpage :
275
Lastpage :
284
Abstract :
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
Keywords :
concurrency control; data integrity; real-time systems; scheduling; earliest-deadline-first; multiversion lock-based concurrency control algorithm; priority-driven preemptive scheduling algorithms; rate-monotone; real-time systems; temporal consistency; workload characteristics; Application software; Computational modeling; Computer science; Concurrency control; Force control; Physics computing; Process control; Real time systems; Robotic assembly; Scheduling algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Control System Design, 1992. (CACSD), 1992 IEEE Symposium on
Conference_Location :
Napa, CA
Type :
conf
DOI :
10.1109/CACSD.1992.274420
Filename :
274420
Link To Document :
بازگشت