REAL-TIME PROCESS SCHEDULING AND OPERATING SYSTEMS

Real-time systems, which could timely deliver applications various system resources to meet their performance specifications, had been studied for many decades. Based on efficient scheduling algorithms and reasonable admission control policies proposed in fundamental researches, the capabilities in resource management for new-generation operating systems implemented are now very flexible and powerful. In this paper, we survey classic and recent results in real-time scheduling algorithms and operating systems to cover both theoretical and practical issues.

[1]  Tei-Wei Kuo,et al.  A dynamic-voltage-adjustment mechanism in reducing the power consumption of flash memory for portable devices , 2001, ICCE. International Conference on Consumer Electronics (IEEE Cat. No.01CH37182).

[2]  Kwei-Jay Lin,et al.  Dynamic priority ceilings: A concurrency control protocol for real-time systems , 1990, Real-Time Systems.

[3]  Kwei-Jay Lin,et al.  Enhancing the real-time capability of the Linux kernel , 1998, Proceedings Fifth International Conference on Real-Time Computing Systems and Applications (Cat. No.98EX236).

[4]  Maryline Chetto,et al.  Some Results of the Earliest Deadline Scheduling Algorithm , 1989, IEEE Transactions on Software Engineering.

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

[6]  Sanjoy K. Baruah,et al.  Static-priority scheduling on multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

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

[8]  Richard Gerber,et al.  Guaranteeing end-to-end timing constraints by calibrating intermediate processes , 1994, 1994 Proceedings Real-Time Systems Symposium.

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

[10]  Jay K. Strosnider,et al.  Modeling bus scheduling policies for real-time systems , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

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

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

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

[14]  Paolo Mantegazza,et al.  Complex Control Systems, Applications of DIAMP-RTAI at DIAMP , 1999 .

[15]  P. Mantegazza,et al.  Complex Control Systems , Applications of DIAPM-RTAI at DIAPM , 2000 .

[16]  Hector Garcia-Molina,et al.  Emulating soft real-time scheduling using traditional operating system schedulers , 1994, 1994 Proceedings Real-Time Systems Symposium.

[17]  Jennifer C. Hou,et al.  Distance-Constrained Scheduling and Its Applications to Real-Time Systems , 1996, IEEE Trans. Computers.

[18]  Kwei-Jay Lin,et al.  Implementing a general real-time scheduling framework in the RED-Linux real-time kernel , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

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

[20]  C.-C. J. Han,et al.  A better polynomial-time schedulability test for real-time multiframe tasks , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[21]  Ching-Chih Han,et al.  A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms , 1997, Proceedings Real-Time Systems Symposium.

[22]  M. Di Natale,et al.  Scheduling The Can Bus With Earliest Deadline Techniques , 2000, RTSS.

[23]  Kwei-Jay Lin,et al.  On-line schedulers for pinwheel tasks using the time-driven approach , 1998, Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168).

[24]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[25]  Tei-Wei Kuo,et al.  Efficient on-line schedulability tests for priority driven real-time systems , 2000, Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000.

[26]  Tei-Wei Kuo,et al.  A cyclic-executive-based QoS guarantee over USB , 2003, The 9th IEEE Real-Time and Embedded Technology and Applications Symposium, 2003. Proceedings..

[27]  Sessions Archer.  The Design and Implementation of the CPU Power Regulator for Multimedia Operating Systems , 1996 .

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

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

[30]  Jane W.-S. Liu,et al.  Scheduling real-time applications in an open environment , 1997, Proceedings Real-Time Systems Symposium.

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

[32]  Seung Ho Hong,et al.  Bandwidth allocation scheme in CAN protocol , 2000 .

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

[34]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[35]  Stephen Childs,et al.  The Linux-SRT integrated multimedia operating system: bringing QoS to the desktop , 2001, Proceedings Seventh IEEE Real-Time Technology and Applications Symposium.

[36]  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.

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