DocumentCode
3613575
Title
An efficient schedulability analysis policing technique for periodic, dynamic real-time applications
Author
Eui-Nam Huh;L.R. Welch;B. Pfarr
fYear
2002
fDate
6/24/1905 12:00:00 AM
Abstract
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). 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.
Keywords
"Dynamic scheduling","Processor scheduling","Application software","Computer science","Performance analysis","Software engineering","Page description languages","Reactive power","Quality of service"
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium., Proceedings International, IPDPS 2002, Abstracts and CD-ROM
Print_ISBN
0-7695-1573-8
Type
conf
DOI
10.1109/IPDPS.2002.1016478
Filename
1016478
Link To Document