The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2013 vol.39)
pp: 910-916
Jinkyu Lee , The University of Michigan, Ann Arbor
Insik Shin , KAIST, Daejeon
ABSTRACT
In real-time systems, correctness depends not only on functionality but also on timeliness. A great number of scheduling theories have been developed for verification of the temporal correctness of jobs (software) in such systems. Among them, the Earliest Deadline first until Zero-Laxity (EDZL) scheduling algorithm has received growing attention thanks to its effectiveness in multicore real-time scheduling. However, the true potential of EDZL has not yet been fully exploited in its schedulability analysis as the state-of-the-art EDZL analysis techniques involve considerable pessimism. In this paper, we propose a new EDZL multicore schedulability test. We first introduce an interesting observation that suggests an insight toward pessimism reduction in the schedulability analysis of EDZL. We then incorporate it into a well-known existing Earliest Deadline First (EDF) schedulability test, resulting in a new EDZL schedulability test. We demonstrate that the proposed EDZL test not only has lower time complexity than existing EDZL schedulability tests, but also significantly improves the schedulability of EDZL by up to 36.6 percent compared to the best existing EDZL schedulability tests.
INDEX TERMS
Real-time systems, Silicon, Scheduling algorithms, Scheduling, Exponential distribution, Time factors, Aerospace electronics, real-time systems, Earliest Deadline first until Zero-Laxity (EDZL), real-time scheduling, schedulability analysis, multicore platform
CITATION
Jinkyu Lee, Insik Shin, "EDZL Schedulability Analysis in Real-Time Multicore Scheduling", IEEE Transactions on Software Engineering, vol.39, no. 7, pp. 910-916, July 2013, doi:10.1109/TSE.2012.75
REFERENCES
[1] C. Liu and J. Layland, "Scheduling Algorithms for Multi-Programming in a Hard-Real-Time Environment," J. ACM, vol. 20, no. 1, pp. 46-61, 1973.
[2] C.-G. Lee, K. Lee, J. Hahn, Y.-M. Seo, S.L. Min, R. Ha, S. Hong, C.Y. Park, M. Lee, and C.S. Kim, "Bounding Cache-Related Preemption Delay for Real-Time Systems," IEEE Trans. Software Eng., vol. 27, no. 9, pp. 805-826, Sept. 2001.
[3] L. Sha, T. Abdelzaher, K.-E. Arzen, A. Cervin, T. Baker, A. Burns, G. Buttazzo, M. Caccamo, J. Lehoczky, and A.K. Mok, "Real Time Scheduling Theory: A Historical Perspective," Real-Time Systems, vol. 28, no. 2/3, pp. 101-155, 2004.
[4] S.K. Lee, "On-Line Multiprocessor Scheduling Algorithms for Real-Time Tasks," Proc. IEEE Region 10's Ninth Ann. Int'l Conf., pp. 607-611, 1994.
[5] J. Lee, A. Easwaran, I. Shin, and I. Lee, "Zero-Laxity Based Real-Time Multiprocessor Scheduling," J. Systems and Software, vol. 84, no. 12, pp. 2324-2333, 2011.
[6] S. Cho, S.-K. Lee, S. Ahn, and K.-J. Lin, "Efficient Real-Time Scheduling Algorithms for Multiprocessor Systems," IEICE Trans. Comm., vol. E85-B, no. 12, pp. 2859-2867, 2002.
[7] M. Park, S. Han, H. Kim, S. Cho, and Y. Cho, "Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor," IEICE Trans. Information and Systems, vol. E88-D, pp. 658-661, 2005.
[8] M. Cirinei and T.P. Baker, "EDZL Scheduling Analysis," Proc. Euromicro Conf. Real-Time Systems, pp. 9-18, 2007.
[9] T.P. Baker, M. Cirinei, and M. Bertogna, "EDZL Scheduling Analysis," Real-Time Systems, vol. 40, pp. 264-289, 2008.
[10] J. Goossens, S. Funk, and S. Baruah, "Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors," Real-Time Systems, vol. 25, no. 2/3, pp. 187-205, 2003.
[11] A. Mok, "Fundamental Design Problems of Distributed Systems for the Hard-Real-Time Environment," PhD dissertation, Massachusetts Inst. of Tech nology, 1983.
[12] H.-W. Wei, Y.-H. Chao, S.-S. Lin, K.-J. Lin, and W.-K. Shih, "Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems," Proc. IEEE Int'l Conf. Embedded and Real-Time Computing Systems and Applications, pp. 120-130, 2007.
[13] Y.-H. Chao, S.-S. Lin, and K.-J. Lin, "Schedulability Issues for EDZL Scheduling on Real-Time Multiprocessor Systems," Information Processing Letters, vol. 107, pp. 158-164, 2008.
[14] S. Kato and N. Yamasaki, "Global EDF-Based Scheduling with Efficient Priority Promotion," Proc. IEEE Int'l Conf. Embedded and Real-Time Computing Systems and Applications, pp. 197-206, 2008.
[15] M. Bertogna, M. Cirinei, and G. Lipari, "Improved Schedulability Analysis of EDF on Multiprocessor Platforms," Proc. Euromicro Conf. Real-Time Systems, pp. 209-218, 2005.
[16] T.P. Baker, "Comparison of Empirical Success Rates of Global vs. Paritioned Fixed-Priority and EDF Scheduling for Hand Real Time," Technical Report TR-050601, Dept. of Computer Science, Florida State Univ., Tallahasee, 2005.
[17] M. Bertogna, M. Cirinei, and G. Lipari, "Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms," IEEE Trans. Parallel and Distributed Systems, vol. 20, no. 4, pp. 553-566, Apr. 2009.
[18] J. Lee, A. Easwaran, and I. Shin, "Laxity Dynamics and LLF Schedulability Analysis on Multiprocessor Platforms," Real-Time Systems, vol. 48, no. 6, pp. 716-749, 2012.
[19] J. Lee, A. Easwaran, and I. Shin, "Maximizing Contention-Free Executions in Multiprocessor Scheduling," Proc. IEEE Real-Time Technology and Applications Symp., pp. 235-244, 2011.
[20] S. Baruah, N.K. Cohen, C.G. Plaxton, and D.A. Varvel, "Proportionate Progress: A Notion of Fairness in Resource Allocation," Algorithmica, vol. 15, no. 6, pp. 600-625, 1996.
[21] A. Srinivasan and S. Baruah, "Deadline-Based Scheduling of Periodic Task Systems on Multiprocessors," Information Processing Letters, vol. 84, no. 2, pp. 93-98, 2002.
[22] S.K. Baruah, "Optimal Utilization Bounds for the Fixed-Priority Scheduling of Periodic Task Systems on Identical Multiprocessors," IEEE Trans. Computers, vol. 53, no. 6, pp. 781-784, June 2004.
29 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool