Real-Time Virtual Resource: A Timely Abstraction for Embedded Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Scalable Applications for Energy-Aware Processors
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
Integrated Design and Implementation of Digital Controllers
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Feasibility Analysis of Real-Time Periodic Tasks with Offsets
Real-Time Systems
Dynamic voltage scaling for the schedulability of jitter-constrained real-time embedded systems
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
Performance Evaluation
Analysis of window-constrained execution time systems
Real-Time Systems
Jitter-approximation tradeoff for periodic scheduling
Wireless Networks
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
IEEE Transactions on Computers
The space of EDF deadlines: the exact region and a convex approximation
Real-Time Systems
Execution aware implementation of numeric PID controllers
ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems
Journal of Systems and Software
Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Hi-index | 0.01 |
Output jitter (the variation in the intercompletion times of successive jobs of the same task) is studied in the context of the preemptive uniprocessor scheduling of periodic real-time tasks. A formal quantitative model for output jitter is proposed. A list of properties that are desirable in any jitter-minimization schedule is enumerated. Algorithms are presented for generating such schedules, and bounds proved for the maximum jitter in schedules generated by these algorithms.