Analysis And Research Of Two-Level Scheduling Profile For Open Real-Time System

Autor: Yongxian Jin, Jingzhou Huang
Jazyk: angličtina
Rok vydání: 2009
Předmět:
DOI: 10.5281/zenodo.1062297
Popis: In an open real-time system environment, the coexistence of different kinds of real-time and non real-time applications makes the system scheduling mechanism face new requirements and challenges. One two-level scheduling scheme of the open real-time systems is introduced, and points out that hard and soft real-time applications are scheduled non-distinctively as the same type real-time applications, the Quality of Service (QoS) cannot be guaranteed. It has two flaws: The first, it can not differentiate scheduling priorities of hard and soft real-time applications, that is to say, it neglects characteristic differences between hard real-time applications and soft ones, so it does not suit a more complex real-time environment. The second, the worst case execution time of soft real-time applications cannot be predicted exactly, so it is not worth while to cost much spending in order to assure all soft real-time applications not to miss their deadlines, and doing that may cause resource wasting. In order to solve this problem, a novel two-level real-time scheduling mechanism (including scheduling profile and scheduling algorithm) which adds the process of dealing with soft real-time applications is proposed. Finally, we verify real-time scheduling mechanism from two aspects of theory and experiment. The results indicate that our scheduling mechanism can achieve the following objectives. (1) It can reflect the difference of priority when scheduling hard and soft real-time applications. (2) It can ensure schedulability of hard real-time applications, that is, their rate of missing deadline is 0. (3) The overall rate of missing deadline of soft real-time applications can be less than 1. (4) The deadline of a non-real-time application is not set, whereas the scheduling algorithm that server 0 S uses can avoid the “starvation" of jobs and increase QOS. By doing that, our scheduling mechanism is more compatible with different types of applications and it will be applied more widely.
{"references":["Z.Deng, J.W.S. Liu. Scheduling Real-Time Applications in an Open\nEnvironment. In: Proc. of the 18th IEEE Real-Time Systems\nSymposium. IEEE Computer Society, 1997, pp.308-319.","Y.C .Wang, K.J. Lin. Implementing a General Real-Time Scheduling\nFramework in the RED-Linux Real-Time Kernel. In: Proc. of the 20th\nIEEE Real-Time Systems Symposium. IEEE Computer Society, 1999,\npp. 246-255.","A.K. Parekh. A generalized processor sharing approach to flow control\nin integrated services networks [Ph.D. Thesis]. Massachusetts Institute\nof Technology,1992.","T.W. Kuo, W.R. Yang, K.J. Lin. EGPS: a class of real-time scheduling\nalgorithms based on processor sharing. In: Proc. of the 10th Euromicro\nWorkshop on Real Time Systems. IEEE Computer Society, 1998,\npp.27-34.","L.Abeni, G.Buttazzo. Integrating Multimedia Applications in Hard\nReal-Time Systems. In: Proc. of the 19th IEEE Real-Time Systems\nSymposium(RTSS-98). IEEE Computer Society,1998, pp. 4-13.","L.Abeni, G.Buttazzo. Resource Reservation in Dynamic Real-Time\nSystems. Real-Time Systems,2004,27: pp.123-167.","G.Lipari, S.Baruah. A Hierarchical Extension to the Constant\nBandwidth Server Framework. In: Proc. of the 7th IEEE Real Time\nTechnology and Applications Symposium.IEEE Computer Society,\n2001, pp. 26-35.","A. Marchand, M. Silly-Chetto. Dynamic Real-time Scheduling of Firm\nPeriodic Tasks with Hard and Soft Aperiodic Tasks. Real-Time\nSystems,2006,32(1-2): pp.21-47.","W.Li, K.Kavi,R.Akl. A non-preemptive scheduling algorithm for soft\nreal-time systems. Computers and Electrical Engineering,2007,33(1):\npp.12-29.\n[10] U.C. Devi, J.H.Anderson. Tardiness bounds under global EDF\nscheduling on a multiprocessor. Real-Time System,2008,38(2):\npp.133-189.\n[11] G.Lipai, J.Carpenter, S.Baruah. A Framework for Achieving\nInter-Application Isolation in Multiprogrammed Hard Real-Time\nEnvironments. In: Proc. of the 21st IEEE Real-Time Systems\nSymposium. IEEE Computer Society, 2000, pp. 217-226.\n[12] Y.C. Gong, L.G. Wang, et al. A Hybrid Real-Time Scheduling\nAlgorithm Based on Rigorously Proportional Dispatching of Serving.\nJournal of Software, 2006,17(3): pp. 611-619. (in Chinese)\n[13] X.Y.Huai, Y.Zou, M.S.Li. An Open Adaptive Scheduling Algorithm\nfor Open Hybrid Real-Time Systems. Journal of Software, 2004,15(4):\npp. 487-496. (in Chinese)\n[14] P.L. Tan, H.Jin, M.H. Zhang. Two-Dimensional Priority Real-Time\nScheduling for Open Systems. Acta Electronica Sinica, 2006, 34(1): pp.\n1773-1777. (in Chinese)\n[15] B.B. Brandenburg, J.H. Anderson. Integrating Hard/Soft Real-Time\nTasks and Best-Effort Jobs on Multiprocessors. In: Proceedings of the\n19th Euromicro Conference on Real-Time Systems. IEEE Computer\nSociety,2007, pp. 61-70.\n[16] Y.Zou, M.S. Li, Q.Wang. Analysis for Scheduling Theory and\nApproach of Open Real-Time System. Journal of Software, 2003,14(1):\npp. 83-90. (in Chinese)\n[17] Z.Deng, J.W.S. Liu, J.Sun. A Scheme for Scheduling Hard-Real-Time\nApplications in Open Environment. In: Proc. of the 9th Euromicro\nWorkshop on Real-Time Systems. IEEE Computer Society Press, 1997,\npp.191-199.\n[18] Y.X.Jin, J.Z.Huang, J.G.Wang. Scheduling for Non-Real Time\nApplications of ORTS Based on Two-Level Scheduling Scheme. To\nappear in: International Journal of Computer Theory and Engineering,\n2009, 1(2): pp.170-180.\n[19] C.L.Liu, J.W.Layland. Scheduling Algorithms for Multiprogramming\nin a Hard Real-Time Environment. Journal of the ACM, 1973, 20(11):\npp. 46-61."]}
Databáze: OpenAIRE
Externí odkaz: