Robust scheduling of real-time applications on efficient embedded multicore systems

Multicore processors are the next technological step in order to increase the processing power in embedded real-time systems. This work focuses on scheduling algorithms as well as examination approaches of real-time, efficiency, and robustness properties for complex task sets in these systems. For this purpose, a task set extension is proposed, which defines complex task activation patterns and the variation of non-preemptive parts of the task execution time. Furthermore, the multicore real-time scheduling algorithms Partly-Pfair-PD² and P-ERfair-PD² are proposed. For schedulability evaluation, a simulation-based examination approach is presented. Finally, a comparison approach for probabilistic task sets is proposed. The application of the contribution is shown in different case studies.

[1]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[2]  Sang Lyul Min,et al.  Analysis of cache-related preemption delay in fixed-priority preemptive scheduling , 1998, 17th IEEE Real-Time Systems Symposium.

[3]  Paul Barford,et al.  Generating representative Web workloads for network and server performance evaluation , 1998, SIGMETRICS '98/PERFORMANCE '98.

[4]  Pradeep Lall,et al.  Temperature dependence of microelectronic device failures , 1990 .

[5]  Sanjoy K. Baruah,et al.  The limited-preemption uniprocessor scheduling of sporadic task systems , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[6]  Marcel Verhoef,et al.  Timed automata based analysis of embedded system architectures , 2006, IPDPS.

[7]  Ronald L. Graham,et al.  Bounds on multiprocessing anomalies and related packing algorithms , 1972, AFIPS '72 (Spring).

[8]  Rolf Ernst,et al.  Scheduling analysis integration for heterogeneous multiprocessor SoC , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[9]  J. Teugels,et al.  Statistics of Extremes , 2004 .

[10]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[11]  Rolf Ernst,et al.  Event model interfaces for heterogeneous system analysis , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[12]  Hermann Kopetz.  Wrong Assumptions and Neglected Areas in Embedded Systems Research , 2008, 2008 11th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC).

[13]  Alan Burns,et al.  Scheduling slack time in fixed priority pre-emptive systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

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

[15]  Alan Burns,et al.  Sensitivity Analysis for EDF Scheduled Arbitrary Deadline Real-Time Systems , 2010, 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications.

[16]  Yue Lu,et al.  A Statistical Approach to Response-Time Analysis of Complex Embedded Real-Time Systems , 2010, 2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications.

[17]  Alan Burns,et al.  Preemptive priority-based scheduling: an appropriate engineering approach , 1995 .

[18]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[19]  Rami G. Melhem,et al.  Multiple-resource periodic scheduling problem: how much fairness is necessary? , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[20]  H. Hahn.  Theorie und Anwendung der unendlichen Reihen , 1932 .

[21]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[22]  Alan Burns,et al.  Applying new scheduling theory to static priority pre-emptive scheduling , 1993, Softw. Eng. J..

[23]  A. Burns,et al.  Notice of RetractionSensitivity analysis of relative deadline for EDF scheduled real-time systems , 2010, 2010 2nd International Conference on Mechanical and Electronics Engineering.

[24]  Marco Spuri,et al.  Scheduling aperiodic tasks in dynamic priority systems , 1996, Real-Time Systems.

[25]  Lothar Thiele,et al.  Composing Functional and State-Based Performance Models for Analyzing Heterogeneous Real-Time Systems , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[26]  Michael González Harbour,et al.  Schedulability analysis for tasks with static and dynamic offsets , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[27]  Sanjoy K. Baruah,et al.  Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors , 2003, Real-Time Systems.

[28]  Kang G. Shin,et al.  Real-time dynamic voltage scaling for low-power embedded operating systems , 2001, SOSP.

[29]  R. Ernst,et al.  Model composition for scheduling analysis in platform design , 2002, Proceedings 2002 Design Automation Conference (IEEE Cat. No.02CH37324).

[30]  Bernd Bertsche.  Automotive Transmissions: Fundamentals, Selection, Design and Application , 1999 .

[31]  Jukka Mäki-Turja,et al.  Efficient implementation of tight response-times for tasks with offsets , 2008, Real-Time Systems.

[32]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[33]  Campus de Viesques,et al.  Worst-Case Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems , 2000 .

[34]  Sonia Ben Dhia,et al.  Electromagnetic Compatibility of Integrated Circuits: Techniques for low emission and susceptibility , 2006 .

[35]  Daniel F. Garcia,et al.  Utilization Bounds for EDF Scheduling on Real-Time Multiprocessor Systems , 2004, Real-Time Systems.

[36]  James H. Anderson,et al.  An EDF-based Restricted-Migration Scheduling Algorithm for Multiprocessor Soft Real-Time Systems ∗ , 2007 .

[37]  Chang-Gun Lee,et al.  Limited Preemptible Scheduling to Embrace Cache Memory in Real-Time Systems , 1998, LCTES.

[38]  Karl-Erik Årzén,et al.  Feedback–Feedforward Scheduling of Control Tasks , 2002, Real-Time Systems.

[39]  Michael R. Hansen,et al.  System-level Verification of Multi-Core Embedded Systems using Timed-Automata , 2008 .

[40]  Sanjoy K. Baruah,et al.  Optimal online multiprocessor scheduling of sporadic real-time tasks is impossible , 2010, Real-Time Systems.

[41]  Simon Künzli,et al.  Efficient design space exploration for embedded systems , 2006 .

[42]  James H. Anderson,et al.  Desynchronized Pfair scheduling on multiprocessors , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[43]  Rhan Ha,et al.  Validating timing constraints in multiprocessor and distributed systems , 1995 .

[44]  Sudarshan Kumar Dhall,et al.  Scheduling periodic-time - critical jobs on single processor and multiprocessor computing systems. , 1977 .

[45]  Robert Tibshirani,et al.  An Introduction to the Bootstrap , 1994 .

[46]  Frank Mueller,et al.  Tightening the Bounds on Feasible Preemption Points , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[47]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[48]  James H. Anderson,et al.  Pfair scheduling: beyond periodic task systems , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[49]  Alan Burns,et al.  Sustainable Scheduling Analysis , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[50]  Aloysius K. Mok,et al.  Multiprocessor On-Line Scheduling of Hard-Real-Time Tasks , 1989, IEEE Trans. Software Eng..

[51]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[52]  Alan Burns,et al.  Hard Real-Time Scheduling: The Deadline-Monotonic Approach , 1991 .

[53]  Daniel F. García,et al.  Minimum and maximum utilization bounds for multiprocessor rate monotonic scheduling , 2004, IEEE Transactions on Parallel and Distributed Systems.

[54]  Hennadiy Leontyev,et al.  Multiprocessor extensions to real-time calculus , 2009, 2009 30th IEEE Real-Time Systems Symposium.

[55]  Rolf Ernst,et al.  A Formal Approach to MpSoC Performance Verification , 2003, Computer.

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

[57]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[58]  Giorgio C. Buttazzo,et al.  Rate Monotonic Analysis: The Hyperbolic Bound , 2003, IEEE Trans. Computers.

[59]  Edward G. Coffman,et al.  An Application of Bin-Packing to Multiprocessor Scheduling , 1978, SIAM J. Comput..

[60]  Giuseppe Lipari,et al.  Soft Real-Time Systems: Predictability vs. Efficiency , 2010 .

[61]  James C. Corbett,et al.  Modeling and analysis of real-time Ada tasking programs , 1994, 1994 Proceedings Real-Time Systems Symposium.

[62]  Shelby Funk,et al.  LRE-TL: An Optimal Multiprocessor Scheduling Algorithm for Sporadic Task Sets , 2009 .

[63]  Sanjoy K. Baruah,et al.  A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms , 2004, Handbook of Scheduling.

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

[65]  Per Stenström,et al.  Timing anomalies in dynamically scheduled microprocessors , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[66]  Giorgio C. Buttazzo,et al.  Preemption Points Placement for Sporadic Task Sets , 2010, 2010 22nd Euromicro Conference on Real-Time Systems.

[67]  Peter J. Denning,et al.  Operating Systems Theory , 1973 .

[68]  Shalabh.  Fundamentals of Probability: a First Course , 2011 .

[69]  Alan Burns,et al.  Restricted tasking models , 1997 .

[70]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[71]  David May,et al.  The XMOS XS1 Architecture , 2009 .

[72]  Giorgio C. Buttazzo,et al.  Comparative evaluation of limited preemptive methods , 2010, 2010 IEEE 15th Conference on Emerging Technologies & Factory Automation (ETFA 2010).

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

[74]  Frank Slomka,et al.  Hierarchical event streams and event dependency graphs: a new computational model for embedded real-time systems , 2006, 18th Euromicro Conference on Real-Time Systems (ECRTS'06).

[75]  Ian T. Foster,et al.  Condor-G: A Computation Management Agent for Multi-Institutional Grids , 2004, Cluster Computing.

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

[77]  Johan J. Lukkien,et al.  Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption , 2007, 19th Euromicro Conference on Real-Time Systems (ECRTS'07).

[79]  Sharad Malik,et al.  Cache miss equations: a compiler framework for analyzing and tuning memory behavior , 1999, TOPL.

[80]  Sanjoy K. Baruah,et al.  Schedulability Analysis of Multiprocessor Sporadic Task Systems , 2007, Handbook of Real-Time and Embedded Systems.

[81]  Robert I. Davis,et al.  A Survey of Hard Real-Time Scheduling Algorithms and Schedulability Analysis Techniques for Multiprocessor Systems , 2009 .

[82]  Lothar Thiele,et al.  Influence of different abstractions on the performance analysis of distributed hard real-time systems , 2009, Des. Autom. Embed. Syst..

[83]  Marco Spuri,et al.  Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms , 2013 .

[84]  Tei-Wei Kuo,et al.  Load adjustment in adaptive real-time systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[85]  Liliana Cucu-Grosjean,et al.  Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors , 2006, 2006 IEEE Conference on Emerging Technologies and Factory Automation.

[86]  Bernd Becker,et al.  A Definition and Classification of Timing Anomalies , 2006, WCET.

[87]  Rolf Ernst,et al.  System level performance analysis - the SymTA/S approach , 2005 .

[88]  C. Leake.  Synchronization and Linearity: An Algebra for Discrete Event Systems , 1994 .

[89]  Ge Yu,et al.  Exact Schedulability Analysis for Static-Priority Global Multiprocessor Scheduling Using Model-Checking , 2007, SEUS.

[90]  Sanjoy K. Baruah,et al.  Preemptively scheduling hard-real-time sporadic tasks on one processor , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[91]  Rolf Ernst,et al.  SymTA/S - Symbolic Timing Analysis for Systems , 2004 .

[92]  Binoy Ravindran,et al.  An Optimal Real-Time Scheduling Algorithm for Multiprocessors , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[93]  L. Devroye.  Non-Uniform Random Variate Generation , 1986 .

[94]  Giuseppe Lipari,et al.  Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.

[95]  Sanjoy K. Baruah.  Techniques for Multiprocessor Global Schedulability Analysis , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[96]  Alan Burns,et al.  Real-Time Systems and Programming Languages - Ada, Real-Time Java and C / Real-Time POSIX, Fourth Edition , 2009, International computer science series.

[97]  A. Burns,et al.  Notice of RetractionSensitivity analysis of task period for EDF scheduled arbitrary deadline real-time systems , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

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

[99]  Rolf Ernst,et al.  Scheduling analysis of real-time systems with precise modeling of cache related preemption delay , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[100]  Giorgio C. Buttazzo,et al.  Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling , 2009, 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications.

[101]  Lothar Thiele,et al.  A general framework for analysing system properties in platform-based embedded system designs , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

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

[103]  John P. Lehoczky,et al.  Fixed priority scheduling of periodic task sets with arbitrary deadlines , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

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

[105]  Thomas A. Henzinger,et al.  Interface Theories for Component-Based Design , 2001, EMSOFT.

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

[107]  Petru Eles,et al.  A Simulation Methodology for Worst-Case Response Time Estimation of Distributed Real-Time Systems , 2008, 2008 Design, Automation and Test in Europe.

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

[109]  Yanhong Liu,et al.  Performance Evaluation of Components Using a Granularity-based Interface Between Real-Time Calculus and Timed Automata , 2010, QAPL.

[110]  N. Metropolis,et al.  The Monte Carlo method. , 1949 .

[111]  Joseph Y.-T. Leung,et al.  Scheduling real-time tasks: algorithms and complexity , 2004 .

[112]  James H. Anderson,et al.  Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems , 2010, 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium.

[113]  J. Hammersley.  SIMULATION AND THE MONTE CARLO METHOD , 1982 .