Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
A Dynamic Real-time Benchmark for Assessment of QoS and Resource Management Technology
RTAS '99 Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium
Statistical Rate Monotonic Scheduling
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
| Hi-index | 0.00 |
Schedulability Analysis (SA) approaches that are based on a priori information and use fixed execution times with constant workloads work well in many application domains and allow pre-deployment guarantees of real-time performance such as Rate Monotonic Analysis (RMA [2]). However, certain realtime applications must operate in highly dynamic environments, thereby precluding accurate characterization of workloads by static models. This leads to the notion that a new SA trigger for dynamic environments, in which applications experience large variations in the workload, needs to guarantee real-time performance during run-time. This paper examines the case of periodic, dynamic real-time systems, and describes an efficient SA policing technique which can trigger SA appropriately, and uses a dynamic threshold which becomes sensitive when the quality of service (QoS) of the dynamic real-time application approaches its deadline.