Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling
IEEE Transactions on Computers
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Aperiodic servers in a deadline scheduling environment
Real-Time Systems
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems
IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
A dynamic scheduler for real-time periodic tasks with quality of service requirements
AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
The BGW model for QoS aware scheduling of real-time embedded systems
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
Optimal procrastination interval for constrained deadline sporadic tasks upon uniprocessors
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
In thispaper, we are concerned with the problem of serving soft aperiodictasks on a uniprocessor system where periodic tasks are scheduledon a dynamic-priority, preemptive basis and exclusively accessto critical sections. Scheduling of tasks is handled by the DynamicPriority Ceiling Protocol working with an Earliest Deadline scheduler.Our analysis determines the maximum processing time which maybe stolen from periodic tasks without jeopardizing both theirtiming constraints and resource consistency. It provides thebasis for an on-line scheduling algorithm, the EDL Server, todeal with the minimization of response times for soft aperiodictasks.