A fixed-priority-driven open environment for real-time applications

This paper extends the useful concept of open systems proposed by W.S. Liu, et al. (1997) in scheduling real-time applications and non-real-time applications, where the schedulability of each real-time application can be validated independently of other applications in the system. We replace the underlying earliest-deadline-first OS scheduler of the open system architecture by W.S. Liu, et al. (1997) with a rate-monotonic OS scheduler. The motivation behind this work is that many existing operating systems may not support the earliest deadline first scheduling very well. We propose to use the idea of sporadic servers to preserve CPU cycles for applications. We also develop schedulability tests for real-time applications which adopt the rate monotonic scheduling algorithm, the earliest deadline first scheduling algorithm, the priority ceiling protocol, and the stack resource policy. We allow tasks in each application to share local and global non-preemptable resources. A global resource synchronization mechanism is proposed. This paper provides a fixed-priority-based alternative for the important open system architecture.

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

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

[3]  Z. Deng,et al.  A scheme for scheduling hard real-time applications in open system environment , 1997, Proceedings Ninth Euromicro Workshop on Real Time Systems.

[4]  Daniel M. Berry,et al.  A time-sharing architecture for complex real-time systems , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.

[5]  Tei-Wei Kuo,et al.  EGPS: a class of real-time scheduling algorithms based on processor sharing , 1998, Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168).

[6]  Tei-Wei Kuo,et al.  Incremental Reconfiguration and Load Adjustment in Adaptive Real-Time Systems , 1997, IEEE Trans. Computers.

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

[8]  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).

[9]  Carl A. Waldspurger,et al.  Lottery and stride scheduling: flexible proportional-share resource management , 1995 .

[10]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.

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

[12]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

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

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

[15]  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).

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

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

[18]  James H. Anderson,et al.  Proportional share scheduling of operating system services for real-time applications , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

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