This paper extends the useful concept of open systems proposed by Liu, et al. 2, 3 in scheduling realtime 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-rst OS scheduler of the open system architecture in 2, 3 with a rate-monotonic OS scheduler. The motivation behind this work is that many existing operating systems may not support the earliest deadline rst scheduling very well. We propose to use the idea of sporadic servers 14 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 rst scheduling algorithm 11 , the priority ceiling protocol 18 , and the stack resource policy 1 . 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 xed-priority-based alternative for the important open system architecture.
This work has been later extended by Kuo et al REF for using rate monotonic as global scheduling algorithm.
A fixed-priority-driven open environment for real-time applications
Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)
Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054)
Computer Science