Mixed-criticality scheduling upon unreliable processors

An unreliable processor is characterized by two execution speeds: a normal speed and a degraded speed. Under normal circumstances it will execute at its normal speed; unexpected conditions may occur during run-time that cause it to execute more slowly (but no slower than at its degraded speed). The problem of executing an integrated workload, consisting of some more important components and some less important ones, upon such an unreliable processor is considered. It is desired that all components execute correctly under normal circumstances, whereas the more important components should execute correctly (although the less important components need not) if the processor runs at any speed no slower than its specified degraded speed.

[1]  Lui Sha,et al.  Memory Access Control in Multiprocessor for Real-Time Systems with Mixed Criticality , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[2]  Wang Yi,et al.  Outstanding Paper Award: Bounding and Shaping the Demand of Mixed-Criticality Sporadic Tasks , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[3]  S. Vestal.  Preemptive Scheduling of Multi-criticality Systems with Varying Degrees of Execution Time Assurance , 2007, RTSS 2007.

[4]  Sanjoy K. Baruah,et al.  Schedulability Analysis of Sporadic Tasks with Multiple Criticality Specifications , 2008, 2008 Euromicro Conference on Real-Time Systems.

[5]  Risat Mahmud Pathan,et al.  Schedulability Analysis of Mixed-Criticality Systems on Multiprocessors , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[6]  Wang Yi,et al.  Effective and Efficient Scheduling of Certifiable Mixed-Criticality Sporadic Task Systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.

[7]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[8]  P. J. Prisaznuk,et al.  Integrated modular avionics , 1992, Proceedings of the IEEE 1992 National Aerospace and Electronics Conference@m_NAECON 1992.

[9]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[10]  Joël Goossens,et al.  Schedulability and sensitivity analysis of multiple criticality tasks with fixed-priorities , 2009, Real-Time Systems.

[11]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[12]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[13]  Sanjoy Baruah,et al.  Global mixed-criticality scheduling on multiprocessors , 2012 .

[14]  Laurent George,et al.  Relaxing Mixed-Criticality Scheduling Strictness for Task Sets Scheduled with FP , 2012, 2012 24th Euromicro Conference on Real-Time Systems.

[15]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[18]  Sanjoy K. Baruah,et al.  Certification-cognizant scheduling of tasks with pessimistic frequency specification , 2012, 7th IEEE International Symposium on Industrial Embedded Systems (SIES'12).

[19]  Alan Burns,et al.  Response-Time Analysis for Mixed Criticality Systems , 2011, 2011 IEEE 32nd Real-Time Systems Symposium.