Budgeted generalized rate monotonic analysis for the partitioned, yet globally scheduled uniprocessor model

This paper solves the challenge of offline response time analysis of independent periodic tasks with constrained deadlines early in the software development cycle, under generalized rate-monotonic scheduling. CPU budgets are allocated to different applications and each application is composed of multiple periodic tasks that must share the same budget. Physical application requirements impose specifications on task periods and deadlines from the very beginning, but unlike the common assumption in traditional response time analysis, task execution times are not known. This is because task execution times depend on the exact system implementation, which is not finalized until later in the development cycle. Questions facing designers become: will my task meet its deadline given lack of knowledge of other tasks' execution times? What is the smallest deadline that my task can meet? These questions are traditionally addressed by using a two level scheduler: CPU is partitioned and assigned to application, and task priorities are determined within the scope of an application, and when server becomes active it schedules the tasks locally. Such two level scheduling approach introduces priority inversion across applications. In our approach, different applications' tasks are globally scheduled and yet the CPU resource is still partitioned and assigned to applications as a CPU budget. We schedule all the tasks globally while enforcing application budgets. The proposed new form of response time analysis is called budgeted generalized rate-monotonic analysis to compute the maximum response time for each task given only application budgets and task periods, but without knowledge of task execution times. We formulate this schedulability problem as a mixed integer linear programming problem and demonstrate a solution that computes the exact worst-case response times. Evaluation shows that our solution outperforms, in terms of schedulability, both global utilization bounds and mechanisms that attain temporal modularity via resource partitioning.

[1]  Daeyoung Kim,et al.  Scheduling tool and algorithm for integrated modular avionics systems , 2000, 19th DASC. 19th Digital Avionics Systems Conference. Proceedings (Cat. No.00CH37126).

[2]  Lui Sha,et al.  Holistic design parameter optimization of multiple periodic resources in hierarchical scheduling , 2013, 2013 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[3]  John B. Goodenough,et al.  Generic Avionics Software Specification , 1990 .

[4]  Kwei-Jay Lin,et al.  An optimal pinwheel scheduler using the single-number reduction technique , 1996, 17th IEEE Real-Time Systems Symposium.

[5]  Alan Burns,et al.  Optimal (D-J)-monotonic priority assignment , 2007, Inf. Process. Lett..

[6]  N. Fisher.  An FPTAS for Interface Selection in the Periodic Resource Model , 2009 .

[7]  Johannes Bisschop,et al.  AIMMS - Optimization Modeling , 2006 .

[8]  John P. Lehoczky,et al.  Analysis of hierar hical fixed-priority scheduling , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.

[9]  Robert I. Davis,et al.  An Investigation into Server Parameter Selection for Hierarchical Fixed Priority Pre-emptive Systems , 2008 .

[10]  Mohamed F. Younis,et al.  Resource scheduling in dependable integrated modular avionics , 2000, Proceeding International Conference on Dependable Systems and Networks. DSN 2000.

[11]  Nathan Fisher,et al.  Approximate Bandwidth Allocation for Fixed-Priority-Scheduled Periodic Resources , 2010, 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium.

[12]  Lui Sha.  Real-Time Virtual Machines for Avionics Software Porting and Development , 2003, RTCSA.

[13]  Luís Almeida,et al.  Scheduling within temporal partitions: response-time analysis and server design , 2004, EMSOFT '04.

[14]  Dong-Won Park,et al.  A generalized utilization bound test for fixed-priority real-time scheduling , 1995, Proceedings Second International Workshop on Real-Time Computing Systems and Applications.

[15]  Alan Burns,et al.  Hierarchical fixed priority pre-emptive scheduling , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[16]  Insup Lee,et al.  Compositional real-time scheduling framework with periodic model , 2008, TECS.

[17]  Giuseppe Lipari,et al.  Resource partitioning among real-time applications , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[18]  Insup Lee,et al.  Compositional real-time scheduling framework , 2004, 25th IEEE International Real-Time Systems Symposium.

[19]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[20]  Rushby John,et al.  Partitioning in Avionics Architectures: Requirements, Mechanisms, and Assurance , 1999 .

[21]  Insup Lee,et al.  Periodic resource model for compositional real-time guarantees , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[22]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[23]  José Rufino,et al.  Architecting Robustness and Timeliness in a New Generation of Aerospace Systems , 2009, WADS.

[24]  Enhanced utilization bounds for QoS management , 2004, IEEE Transactions on Computers.

[25]  Paul Pop,et al.  Optimization of Time-Partitions for Mixed-Criticality Real-Time Distributed Embedded Systems , 2011, 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops.

[26]  Lui Sha,et al.  Real-time scheduling theory and Ada , 1990, Computer.

[27]  James H. Anderson,et al.  RTOS Support for Multicore Mixed-Criticality Systems , 2012, 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium.

[28]  Tei-Wei Kuo,et al.  Utilization bound revisited , 2003 .

[29]  Paul Pop,et al.  Design Optimization of Mixed-Criticality Real-Time Applications on Cost-Constrained Partitioned Architectures , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[30]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.