The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2013 vol.62)
pp: 1255-1268
Jianjun Li , Huazhong University of Science and Technology, Wuhan
Ming Xiong , Google Inc., New York
Victor C.S. Lee , City University of Hong Kong, Hong Kong
LihChyun Shu , National Cheng Kung University, Taiwan
Guohui Li , Huazhong University of Science and Technology, Wuhan
ABSTRACT
Deriving deadlines and periods for update transactions so as to maintain timeliness and data freshness while minimizing imposed workload has long been recognized an important problem in real-time database research. Despite years of active research, the state-of-the-art still has much room for improvement, particularly for periodic transactions scheduled by the Earliest Deadline First (EDF) algorithm. In this paper, we propose a practical and efficient two-phase algorithm, GEneral EDF ($({\cal G}{\cal E}_{EDF})$), for assigning periods and deadlines to EDF-scheduled update transactions. Phase 1 of $({\cal G}{\cal E}_{EDF})$ aims at finding solutions for most inputs in linear time, based on the observation that the execution times of update transactions are relatively small compared to the validity interval lengths of real-time data objects in many real-time applications. In the remaining cases for which Phase 1 fails to derive solutions, Phase 2 is invoked by employing an existing deadline-monotonic-based algorithm, which we show is also applicable to our problem. Meanwhile, we have devised several techniques which significantly reduce the cost of schedulability test, and hence greatly improve time efficiency. Our experimental results demonstrate that $({\cal G}{\cal E}_{EDF})$ outperforms existing approaches in terms of generated workloads. Although Phase 2 has a pseudopolynomial time complexity, our experimental study shows that it runs much faster than other solutions with comparable quality.
INDEX TERMS
Real time systems, Delta modulation, Complexity theory, Databases, Electronic mail, Educational institutions, Engines, earliest deadline first, Real-time databases, temporal consistency, update transaction, periods and deadlines
CITATION
Jianjun Li, Ming Xiong, Victor C.S. Lee, LihChyun Shu, Guohui Li, "Workload-Efficient Deadline and Period Assignment for Maintaining Temporal Consistency under EDF", IEEE Transactions on Computers, vol.62, no. 6, pp. 1255-1268, June 2013, doi:10.1109/TC.2012.69
REFERENCES
[1] P. Balbastre, I. Ripoll, and A. Crespo, "Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems," IEEE Trans. Computers, vol. 57, no. 1, pp. 96-109, Jan. 2008.
[2] S. Baruah, L. Rosier, and R. Howell, "Algorithms and Complexity Concerning the Preemptive Scheduling of Periodic, Real-Time Tasks on One Processor," Real-Time Systems, vol. 2, no. 4, pp. 301-324, 1990.
[3] A. Burns and R. Davis, "Choosing Task Periods to Minimise System Utilisation in Time Triggered Systems," Information Processing Letters, vol. 58, no. 5, pp. 223-229, 1996.
[4] G. Buttazzo, Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications. Springer, 2005.
[5] T. Chantem, X. Wang, M. Lemmon, and X. Hu, "Period and Deadline Selection for Schedulability in Real-Time Systems," Proc. Euromicro Conf. Real-Time Systems (ECRTS '08), pp. 168-177, 2008.
[6] R. Gerber, S. Hong, and M. Saksena, "Guaranteeing End-to-End Timing Constraints by Calibrating Intermediate Processes," Proc. IEEE Real-Time Systems Symp., pp. 192-203, 1994.
[7] T. Gustafsson and J. Hansson, "Data Management in Real-Time Systems: A Case of on-Demand Updates in Vehicle Control Systems," Proc. 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. ACM Symp. Applied Computing, pp. 846-853, 2004.
[9] S. Han, D. Chen, M. Xiong, and A. Mok, "A Schedulability Analysis of Deferrable Scheduling Using Patterns," Proc. Euromicro Conf. Real-Time Systems (ECRTS), pp. 47-56, 2008.
[10] S. Han, D. Chen, M. Xiong, and A. Mok, "Online Scheduling Switch for Maintaining Data Freshness in Flexible Real-Time Systems," Proc. IEEE Real-Time Systems Symp., pp. 115-124, 2009.
[11] S. Ho, T. Kuo, and A. Mok, "Similarity-Based Load Adjustment for Real-Time Data-Intensive Applications," Proc. IEEE Real-Time Systems Symp., pp. 144-154, 1997.
[12] H. Hoang, G. Buttazzo, M. Jonsson, and S. Karlsson, "Computing the Minimum EDF Feasible Deadline in Periodic Systems," Proc. Int'l Conf. Embedded and Real-Time Computing Systems and Applications, pp. 125-134, 2006.
[13] A. Jha, M. Xiong, and K. Ramamritham, "Mutual Consistency in Real-Time Databases," Proc. IEEE Real-Time Systems Symp., pp. 335-343, 2006.
[14] K. Kang, S. Son, J. Stankovic, and T. Abdelzaher, "A QoS-Sensitive Approach for Timeliness and Freshness Guarantees in Real-Time Databases," Proc. Euromicro Conf. Real-Time Systems (ECRTS), 2002.
[15] K. Kang, Y. Zhou, and J. Oh, "Estimating and Enhancing Real-Time Data Service Delays: Control Theoretic Approaches," IEEE Trans. Knowledge and Data Eng., vol. 23, no. 4, pp. 554-567, Apr. 2011.
[16] Y. Kim and S. Son, "Predictability and Consistency in Real-Time Database Systems," Advances in Real-Time Systems, pp. 509-531, Prentice-Hall, 1993.
[17] T. Kuo and A. Mok, "Load Adjustment in Adaptive Real-Time Systems," Proc. IEEE Real-Time Systems Symp., pp. 160-171, 1991.
[18] T. Kuo and A. Mok, "Real-Time Data Semantics and Similarity-Based Concurrency Control," IEEE Trans. Computers, vol. 49, no. 11, pp. 1241-1254, Nov. 2000.
[19] K. Lam, M. Xiong, B. Liang, and Y. Guo, "Statistical Quality of Service Guarantee for Temporal Consistency of Real-Time Data Objects," Proc. IEEE Real-Time Systems Symp., 2004.
[20] D. Locke, "Real-Time Databases: Real-World Requirements," Real-Time Databases Systems: Issues and Applications, pp. 83-92, Kluwer, 1997.
[21] L. Lundberg, "Utilization Based Schedulability Bounds for Age Constraint Process Sets in Real-Time Systems," Real-Time Systems, vol. 23, no. 3, pp. 273-295, 2002.
[22] K. Ramamritham, "Real-Time Databases," Distributed and Parallel Databases, vol. 1, no. 2, pp. 199-226, 1993.
[23] K. Ramamritham, "Where Do Time Constraints Come From? Where Do They Go?" J. Database Management, vol. 7, pp. 4-11, 1996.
[24] K. Ramamritham, S. Son, and L. Dipippo, "Real-Time Databases and Data Services," Real-Time Systems, vol. 28, no. 2, pp. 179-215, 2004.
[25] C. Shih and J. Liu, "State-Dependent Deadline Scheduling," Proc. IEEE Real-Time Systems Symp., pp. 3-14, 2002.
[26] X. Song and J. Liu, "Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 5, pp. 786-796, Oct. 1995.
[27] M. Spuri, "Analysis of Deadline Scheduled Real-Time Systems," Technical Report 2772, INRIA, 1996.
[28] S. Vestal, "Real-Time Sampled Signal Flows through Asynchronous Distributed Systems," Proc. IEEE Real-Time and Embedded Technology and Applications Symp., pp. 170-179, 2005.
[29] M. Xiong, S. Han, K. Lam, and D. Chen, "Deferrable Scheduling for Maintaining Real-Time Data Freshness: Algorithms, Analysis, and Results," IEEE Trans. Computers, vol. 57, no. 7, pp. 952-964, July 2008.
[30] M. Xiong and K. Ramamritham, "Deriving Deadlines and Periods for Real-Time Update Transactions," IEEE Trans. Computers, vol. 53, no. 5, pp. 567-583, May 2004.
[31] M. Xiong, Q. Wang, and K. Ramamritham, "On Earliest Deadline First Scheduling for Temporal Consistency Maintenance," Real-Time Systems, vol. 40, no. 2, pp. 208-237, 2008.
[32] F. Zhang and A. Burns, "Schedulability Analysis for Real-Time Systems with EDF Scheduling," IEEE Trans. Computers, vol. 58, no. 9, pp. 1250-1258, Sept. 2009.
[33] Y. Zhou and K. Kang, "Deadline Assignment and Tardiness Control for Real-Time Data Services," Proc. Euromicro Conf. Real-Time Systems (ECRTS), 2010.
37 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool