A priori overload handling in ERfair scheduled embedded systems: Hybrid automata approach

Handling overloads in dynamic real-time embedded systems which are subject to frequent workload changes is a critical issue as it allows graceful quality of service (QoS) degradation and provides a mechanism to determine the load to be shed to handle the overload. This paper presents a novel hybrid automata based ERfair scheduling framework for a real-time system which may be subjected to transient overloads. Each task has an assigned criticality value and consists of two parts, a mandatory part and an optional part. The probability distribution of task arrivals is assumed to be known in advance. The framework employs a formal automata based a priori analysis mechanism for detecting and avoiding possible overload within a stipulated time in future. The proposed formal model is verifiable, thereby making it suitable to model a complex system. The verifiable model ensures that all possible cases of overloads are detected and chances of false positives are minimized, thereby maximizing resource utilization.

[1]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[2]  Sujoy Ghose,et al.  Safe-ERfair – A priori Overload Handling in Fair Scheduled Embedded Systems , 2010, 2010 23rd International Conference on VLSI Design.

[3]  Gihyun Jung,et al.  Real-Time Scheduling Algorithm for Minimizing Maximum Weighted Error with O(N log N + cN) Complexity , 1998, Inf. Process. Lett..

[4]  Scott A. Brandt,et al.  DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling , 2010, 2010 22nd Euromicro Conference on Real-Time Systems.

[5]  Giuseppe Lipari,et al.  Elastic Scheduling for Flexible Workload Management , 2002, IEEE Trans. Computers.

[6]  H. Aydin,et al.  An Incremental Server for Scheduling Overloaded Real-Time Systems , 2003, IEEE Trans. Computers.

[7]  James H. Anderson,et al.  Mixed Pfair/ERfair scheduling of asynchronous periodic tasks , 2004, J. Comput. Syst. Sci..

[8]  Jörgen Hansson,et al.  Imprecise task scheduling and overload management using OR-ULD , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[9]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Luca Abeni,et al.  Adaptive rate control through elastic scheduling , 2000, Proceedings of the 39th IEEE Conference on Decision and Control (Cat. No.00CH37187).

[11]  Stavros Tripakis,et al.  Modeling, Verification and Testing using Timed and Hybrid Automata , 2009 .

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[13]  Gerhard Fohler,et al.  Value Based Overload Handling of Aperiodic Tasks in Offline Scheduled Real-Time Systems , 2001 .

[14]  Steve Goddard,et al.  A theory of rate-based execution , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[15]  Maryline Chetto,et al.  Dynamic scheduling of periodic skippable tasks in an overloaded real-time system , 2008, 2008 IEEE/ACS International Conference on Computer Systems and Applications.

[16]  Steve Goddard,et al.  Rate-Based Resource Allocation Models for Embedded Systems , 2001, EMSOFT.

[17]  Sanjoy K. Baruah,et al.  Fast scheduling of periodic tasks on multiple resources , 1995, Proceedings of 9th International Parallel Processing Symposium.

[18]  Jane W.-S. Liu,et al.  i . ' il ' . Imprecise Results : Utilizing Partial Computations in Real-Time Systems , 2004 .

[19]  James H. Anderson,et al.  Early-release fair scheduling , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.