Uniprocessor EDF Scheduling of AVR Task Systems
Abstract
The adaptive varying-rate (AVR) task model has been proposed as a means of modeling certain physically-derived constraints in CPS's in a manner that is more accurate (less pessimistic) than is possible using prior task models from real-time scheduling theory. Existing work on schedulabil- ity analysis of systems of AVR tasks is primarily restricted to fixed-priority scheduling; this paper establishes schedu- lability analysis results for systems of AVR and sporadic tasks under Earliest Deadline First (EDF) scheduling. The proposed analysis techniques are evaluated both theoretically via the speedup factor metric, and experimentally via schedulability experiments on randomly-generated task systems.
Recommended Citation
Z. Guo and S. K. Baruah, "Uniprocessor EDF Scheduling of AVR Task Systems," Proceedings of the 6th ACM/IEEE International Conference on Cyber-Physical Systems(2015, New York, NY), pp. 159 - 168, Association for Computing Machinery (ACM), Apr 2015.
The definitive version is available at https://doi.org/10.1145/2735960.2735976
Meeting Name
6th ACM/IEEE International Conference on Cyber-Physical Systems, ICCPS 2015 (2015: Apr. 14-16, New York, NY)
Department(s)
Computer Science
Keywords and Phrases
Embedded Systems; Scheduling; Scheduling Algorithms
International Standard Book Number (ISBN)
978-1-4503-3455-6
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2015 Association for Computing Machinery (ACM), All rights reserved.
Publication Date
01 Apr 2015
