The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2008 vol.57)
pp: 952-964
ABSTRACT
The periodic update transaction model has been used to maintain freshness (or temporal validity) of real-time data. Period and deadline assignment has been the main focus in the past studies such as the More-Less scheme [25] in which update transactions are guaranteed by the Deadline Monotonic scheduling algorithm [16] to complete by their deadlines. In this article, we propose a deferrable scheduling algorithm for fixed priority transactions - a novel approach for minimizing update workload while maintaining the temporal validity of real-time data. In contrast to prior work on maintaining data freshness periodically, update transactions follow an aperiodic task model in the deferrable scheduling algorithm. The deferrable scheduling algorithm exploits the semantics of temporal validity constraint of real-time data by judiciously deferring the sampling times of update transaction jobs as late as possible. We present a theoretical estimation of its processor utilization, and a sufficient condition for its schedulability. Our experimental results verify the theoretical estimation of the processor utilization. We demonstrate through the experiments that the deferrable scheduling algorithm is an effective approach, and it significantly outperforms the More-Less scheme in terms of reducing processor workload.
INDEX TERMS
Real-time systems and embedded systems, Scheduling, Real-time and embedded systems
CITATION
Ming Xiong, Song Han, Kam-Yiu Lam, Deji Chen, "Deferrable Scheduling for Maintaining Real-Time Data Freshness: Algorithms, Analysis, and Results", IEEE Transactions on Computers, vol.57, no. 7, pp. 952-964, July 2008, doi:10.1109/TC.2008.16
REFERENCES
[1] N.C. Audsley, A. Burns, M.F. Richardson, and A.J. Wellings, “Data Consistency in Hard Real-Time Systems,” Informatica, vol. 19, no. 2, 1995.
[2] A. Burns and R. Davis, “Choosing Task Periods to Minimize System Utilization in Time-Triggered Systems,” Information Processing Letters, vol. 58, pp. 223-229, 1996.
[3] D. Chen and A.K. Mok, “Scheduling Similarity-Constrained Real-Time Tasks,” Proc. Int'l Conf. Embedded Systems and Applications and Int'l Conf. VLSI, pp. 215-221, 2004.
[4] H. Chetto and M. Chetto, “Some Results of the Earliest Deadline Scheduling Algorithm,” IEEE Trans. Software Eng., vol. 15, no. 10, pp. 1261-1269, Oct. 1989.
[5] R. Gerber, S. Hong, and M. Saksena, “Guaranteeing End-to-End Timing Constraints by Calibrating Intermediate Processes,” Proc. 15th IEEE Real-Time Systems Symp., 1994.
[6] G. Goud, N. Sharma, K. Ramamritham, and S. Malewar, “Efficient Real-Time Support for Automotive Applications: A Case Study,” Proc. 12th IEEE Int'l Conf. Embedded and Real-Time Computing Systems and Applications, 2006.
[7] T. Gustafsson and J. Hansson, “Data Management in Real-Time Systems: A Case of On-Demand Updates in Vehicle Control Systems,” Proc. 10th IEEE Real-Time and Embedded Technology and Applications Symp., pp. 182-191, 2004.
[8] T. Gustafsson and J. Hansson, “Dynamic On-Demand Updating of Data in Real-Time Database Systems,” Proc. 19th ACM Symp. Applied Computing, 2004.
[9] C.C. Han, K.J. Lin, and J.W.-S. Liu, “Scheduling Jobs with Temporal Distance Constraints,” SIAM J. Computing, vol. 24, no. 5, pp. 1104-1121, Oct. 1995.
[10] A.K. Jha, M. Xiong, and K. Ramamritham, “Mutual Consistency in Real-Time Databases,” Proc. 28th IEEE Real-Time Systems Symp., 2006.
[11] K.D. Kang, S. Son, J.A. Stankovic, and T. Abdelzaher, “A QoS-Sensitive Approach for Timeliness and Freshness Guarantees in Real-Time Databases,” Proc. 14th Euromicro Conf. Real-Time Systems, 2002.
[12] T. Kuo and A.K. Mok, “Real-Time Data Semantics and Similarity-Based Concurrency Control,” Proc. 13th IEEE Real-Time Systems Symp., 1992.
[13] T. Kuo and A.K. Mok, “SSP: A Semantics-Based Protocol for Real-Time Data Access,” Proc. 14th IEEE Real-Time Systems Symp., 1993.
[14] S. Ho, T. Kuo, and A.K. Mok, “Similarity-Based Load Adjustment for Real-Time Data-Intensive Applications,” Proc. 18th IEEE Real-Time Systems Symp., 1997.
[15] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. 11th IEEE Real-Time Systems Symp., 1990.
[16] J. Leung and J. Whitehead, “On the Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks,” Performance Evaluation, vol. 2, pp. 237-250, 1982.
[17] C.L. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, 1973.
[18] D. Locke, “Real-Time Databases: Real-World Requirements,” Real-Time Database Systems: Issues and Applications, A. Bestavros, K.-J.Lin, and S.H. Son, eds., pp. 83-91, Kluwer Academic, 1997.
[19] K. Ramamritham, “Real-Time Databases,” Distributed and Parallel Databases, vol. 1, pp. 199-226, 1993.
[20] K. Ramamritham, “Where Do Time Constraints Come From and Where Do They Go?” Int'l J. Database Management, vol. 7, no. 2, pp.4-10, Spring 1996.
[21] X. Song and J.W.S. Liu, “How Well Can Data Temporal Consistency Be Maintained?” Proc. IEEE Symp. Computer-Aided Control Systems Design, 1992.
[22] X. Song and J.W.S. Liu, “Maintaining Temporal Consistency: Pessimistic versus Optimistic Concurrency Control,” IEEE Trans. Knowledge and Data Eng., vol. 7, no. 5, pp. 786-796, Oct. 1995.
[23] J.A. Stankovic, S. Son, and J. Hansson, “Misconceptions about Real-Time Databases,” Computer, vol. 32, no. 6, pp. 29-36, June 1999.
[24] S. Vestal, “Real-Time Sampled Signal Flows through Asynchronous Distributed Systems,” Proc. 11th IEEE Real-Time and Embedded Technology and Applications Symp., pp. 170-179, 2005.
[25] M. Xiong and K. Ramamritham, “Deriving Deadlines and Periods for Real-Time Update Transactions,” Proc. 20th IEEE Real-Time Systems Symp., 1999.
[26] M. Xiong, K. Ramamritham, J.A. Stankovic, D. Towsley, and R.M. Sivasankaran, “Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics,” IEEE Trans. Knowledge and Data Eng., vol. 14, no. 5, pp. 1155-1166, Sept./Oct. 2002.
[27] M. Xiong, S. Han, and K.Y. Lam, “A Deferrable Scheduling Algorithm for Real-Time Transactions Maintaining Data Freshness,” Proc. 26th IEEE Real-Time Systems Symp., 2005.
[28] M. Xiong, S. Han, and D. Chen, “Deferrable Scheduling for Temporal Consistency: Schedulability Analysis and Overhead Reduction,” Proc. 12th IEEE Int'l Conf. Embedded and Real-Time Computing Systems and Applications, 2006.
[29] M. Xiong, S. Han, D. Chen, and K.Y. Lam, “Deferrable Scheduling for Maintaining Real-Time Data Freshness: Algorithms, Analysis, and Results,” Technical Report TR-07-44, Dept. of Computer Sciences, Univ. of Texas at Austin, Sept. 2007.
[30] M. Xiong, B. Liang, K.Y. Lam, and Y. Guo, “Quality of Service Guarantee for Temporal Consistency of Real-Time Transactions,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 8, pp. 1097-1110, Aug. 2006.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool