Fixed priority pre-emptive scheduling: An historical perspective

From its roots in job-shop scheduling, research into fixed priority pre-emptive scheduling theory has progressed from the artificial constraints and simplistic assumptions used in early work to a sufficient level of maturity that it is being increasingly used in the implementation of real-time systems. It is therefore appropriate that within this special issue we provide an historical perspective on the development of fixed priority pre-emptive scheduling.

[1]  Ragunathan Rajkumar,et al.  Synchronization in Real-Time Systems , 1991 .

[2]  Edmund H. Durfee,et al.  Approximate Processing in Real-Time Problem Solving , 1988, AI Mag..

[3]  Lui Sha,et al.  Aperiodic task scheduling for Hard-Real-Time systems , 2006, Real-Time Systems.

[4]  Hideyuki Tokuda,et al.  A Time-Driven Scheduling Model for Real-Time Operating Systems , 1985, RTSS.

[5]  Wei Zhao,et al.  Architectural impact of FDDI network on scheduling hard real-time traffic , 1991 .

[6]  John P. Lehoczky,et al.  Fixed priority scheduling periodic tasks with varying execution priority , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

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

[8]  Jay K. Strosnider,et al.  ENHANCED APERIODIC RESPONSIVENESS IN HARD REAL-TIME ENVIRONMENTS. , 1987, RTSS 1987.

[9]  Lui Sha,et al.  Mode change protocols for priority-driven preemptive scheduling , 1989, Real-Time Systems.

[10]  Peter P. Puschner,et al.  Calculating the maximum execution time of real-time programs , 1989, Real-Time Systems.

[11]  Ashok K. Agrawala,et al.  Real-time system design , 1990, McGraw-Hill Computer Science series.

[12]  Lui Sha,et al.  Priority Inheritance Protocols: An Approach to Real-Time Synchronization , 1990, IEEE Trans. Computers.

[13]  Richard K. J. Henn.  Feasible processor allocation in a Hard-Real-Time environment , 2006, Real-Time Systems.

[14]  Dennis W. Leinbaugh,et al.  Guaranteed response times in a distributed hard-real-time environment , 1986, IEEE Transactions on Software Engineering.

[15]  Mario J. Gonzalez.  Deterministic Processor Scheduling , 1977, CSUR.

[16]  Andy J. Wellings,et al.  The use of preemptive priority-based scheduling for space applications , 1993, 1993 Proceedings Real-Time Systems Symposium.

[17]  Alan Burns,et al.  INCORPORATING UNBOUNDED ALGORITHMS INTO PREDICTABLE REAL-TIME SYSTEMS , 1993 .

[18]  Paul G. Sorenson,et al.  A Real-Time System Design Methodology* , 1975 .

[19]  Krithi Ramamritham,et al.  Allocation and scheduling of complex periodic tasks , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[20]  Alan Burns,et al.  Real-time systems and their programming languages , 1986, International computer science series.

[21]  Wayne E. Smith.  Various optimizers for single‐stage production , 1956 .

[22]  John A. Clark,et al.  Holistic schedulability analysis for distributed hard real-time systems , 1994, Microprocess. Microprogramming.

[23]  Jun Sun.  Fixed-priority scheduling of periodic tasks with end-to-end deadlines , 1997 .

[24]  Krithi Ramamritham,et al.  Hard Real-Time Systems , 1988 .

[25]  Jun Sun,et al.  Perts: a Prototyping Environment for Real-Time Systems , 1996, Int. J. Softw. Eng. Knowl. Eng..

[26]  Lui Sha,et al.  Solutions for Some Practical Problems in Prioritized Preemptive Scheduling , 1986, RTSS.

[27]  Alan Burns,et al.  Deadline Monotonic Scheduling Theory , 1992 .

[28]  Theodore P. Baker,et al.  A stack-based resource allocation policy for realtime processes , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[29]  Alexander D. Stoyen,et al.  Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention , 1992, Real-Time Systems.

[30]  Dennis W. Leinbaugh.  Guaranteed Response Times in a Hard-Real-Time Environment , 1980, IEEE Transactions on Software Engineering.

[31]  Alan Burns,et al.  A Review of Ada Tasking , 1987, Lecture Notes in Computer Science.

[32]  Chang Yun Park,et al.  Predicting program execution times by analyzing static and dynamic program paths , 1993, Real-Time Systems.

[33]  H. R. Simpson.  Four-slot fully asynchronous communication mechanism , 1990 .

[34]  Glenn K. Manacher,et al.  Production and Stabilization of Real-Time Task Schedules , 1967, JACM.

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

[36]  Paul K. Harten.  Response times in level-structured systems , 1987, TOCS.

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

[38]  Henry Ledgard,et al.  Reference Manual for the ADA® Programming Language , 1983, Springer New York.

[39]  Sheila B. Banks,et al.  Pilot's Associate: Evolution of a Functional Prototype, , 1991 .

[40]  William Pugh,et al.  A partial evaluator for the Maruti hard real-time system , 2005, Real-Time Systems.

[41]  Tom Roseman.  Rate monotonic analysis , 1992, TRI-Ada '92.

[42]  Richard Gerber,et al.  Semantics-based compiler transformations for enhanced schedulability , 1993, 1993 Proceedings Real-Time Systems Symposium.

[43]  Lui Sha,et al.  Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm , 1988, Proceedings. Real-Time Systems Symposium.

[44]  John P. Lehoczky,et al.  An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[45]  Wolfgang A. Halang,et al.  Constructing Predictable Real Time Systems , 1991 .

[46]  Lui Sha,et al.  Priority inversion in Ada , 1987, ALET.

[47]  Alan Burns,et al.  The End Of The Line For Static Cyclic Scheduling? , 1993, Fifth Euromicro Workshop on Real-Time Systems.

[48]  Krithi Ramamritham,et al.  Advances in Real-Time Systems , 1993 .

[49]  Lui Sha,et al.  Scheduling sporadic and aperiodic events in a hard real-time system. Final report , 1989 .

[50]  Neil Audsley,et al.  Flexible Scheduling in Hard Real-Time Systems , 1993 .

[51]  Lui Sha,et al.  On Countering the Effects of Cycle-Stealing in a Hard Real-Time Environment , 1987, RTSS.

[52]  Omri Serlin,et al.  Scheduling of time critical processes , 1899, AFIPS '72 (Spring).

[53]  Mark Klein,et al.  A practitioner's handbook for real-time analysis - guide to rate monotonic analysis for real-time systems , 1993, The Kluwer international series in engineering and computer science.

[54]  Alexander D. Stoyen.  A Schedulability Analyzer for Real-Time Euclid , 1987, RTSS.

[55]  Alan Burns,et al.  The Impact of an Ada Run-Time System's Performance Characteristics on Scheduling Models , 1993, Ada-Europe.

[56]  Alan Burns,et al.  STRESS: A simulator for hard real‐time systems , 1994, Softw. Pract. Exp..

[57]  Alan Burns,et al.  Pipelined processors and worst case execution times , 1993, Real-Time Systems.

[58]  Alan Burns,et al.  Allocating hard real-time tasks: An NP-Hard problem made easy , 1992, Real-Time Systems.

[59]  Lui Sha,et al.  Real-time synchronization protocols for multiprocessors , 1988, Proceedings. Real-Time Systems Symposium.

[60]  Riccardo Bettati,et al.  PERTS: A prototyping environment for real-time systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

[61]  Lui Sha,et al.  Limitations of Ada for real-time scheduling , 1987, IRTAW '87.

[62]  Constance L. Heitmeyer,et al.  MT: A toolset for specifying and analyzing real-time systems , 1993, 1993 Proceedings Real-Time Systems Symposium.

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

[64]  R. Rajkumar.  Real-time synchronization protocols for shared memory multiprocessors , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[65]  Hideyuki Tokuda,et al.  A real-time tool set for the ARTS kernel , 1988, Proceedings. Real-Time Systems Symposium.

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

[67]  C. Douglas Locke,et al.  Software architecture for hard real-time applications: Cyclic executives vs. fixed priority executives , 1992, Real-Time Systems.

[68]  Wei-Kuan Shih,et al.  Algorithms for scheduling imprecise computations , 1991, Computer.

[69]  David B. Whalley,et al.  A retargetable technique for predicting execution time , 1992, [1992] Proceedings Real-Time Systems Symposium.

[70]  A. D. Stoyenko,et al.  Real-time Euclid: a language for reliable real-time systems , 1989 .

[71]  Jay K. Strosnider,et al.  Responsive, deterministic IEEE 802.5 token ring scheduling , 1989, Real-Time Systems.

[72]  C. Douglas Locke,et al.  Building a predictable avionics platform in Ada: a case study , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

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

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

[75]  Alan Burns,et al.  Mode changes in priority preemptively scheduled systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[76]  Butler W. Lampson,et al.  Experience with processes and monitors in Mesa , 1980, CACM.

[77]  Lui Sha,et al.  An Optimal Priority Inheritance Protocol for Real-Time Synchronization , 1988 .

[78]  L. Sha,et al.  The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasks , 1988, IRTAW '88.

[79]  Jay K. Strosnider,et al.  Engineering and Analysis of Fixed Priority Schedulers , 1993, IEEE Trans. Software Eng..

[80]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[81]  Luc Boullart,et al.  Analysing real-time systems by means of aggregate approach , 1995 .

[82]  J.A. Stankovic,et al.  Misconceptions about real-time computing: a serious problem for next-generation systems , 1988, Computer.

[83]  C. D. Locke,et al.  Best-effort decision-making for real-time scheduling , 1986 .

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

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

[86]  A. Burns,et al.  Scheduling hard real-time systems: a review , 1991, Softw. Eng. J..

[87]  P. Pleinevaux.  An improved hard real-time scheduling for the IEEE 802.5 , 2004, Real-Time Systems.

[88]  Kevin Jeffay.  Analysis of a synchronization and scheduling discipline for real-time tasks with preemption constraints , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[89]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[90]  B. Wyle,et al.  Management of Periodic Operations in a Real-Time Computation System , 1899 .

[91]  Alan Burns,et al.  An extendible approach for analyzing fixed priority hard real-time tasks , 1994, Real-Time Systems.

[92]  Alan Burns,et al.  Formal specifications and proofs of inheritance protocols for real-time scheduling , 1990, Softw. Eng. J..

[93]  Jay K. Strosnider,et al.  Engineering and analysis of real-time microkernels , 1992 .

[94]  BurnsA..  Scheduling hard real-time systems , 1991 .

[95]  Alan Burns,et al.  Fixed priority scheduling with deadlines prior to completion , 1994, Proceedings Sixth Euromicro Workshop on Real-Time Systems.

[96]  A. Burns,et al.  Deadline monotonic scheduling theory and application , 1993 .

[97]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..

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

[99]  Mathai Joseph.  On a Problem in Real-Time Computing , 1985, Inf. Process. Lett..