Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Dynamic adaptation of real-time software
ACM Transactions on Computer Systems (TOCS)
Dynamic Scheduling of Hard Real-Time Tasks and Real-Time Threads
IEEE Transactions on Software Engineering
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
IEEE Transactions on Software Engineering
A Specification Framework for Real-Time Scheduling
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
A Task Model to Reduce Control Delays
Real-Time Systems
A New Scheduling Algorithm and a Compensation Strategy for Imprecise Computation
COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
An Analysis of Totally Clairvoyant Scheduling
Journal of Scheduling
An execution overrun management mechanism for the temporal robustness of Java real-time systems
JTRES '06 Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
IEEE Transactions on Computers
Improving responsiveness of soft aperiodic tasks using proportional slack time
Computers and Electrical Engineering
Failure prevention of real-time systems based on the latest execution time
RTC'05 Proceedings of the 14th IEEE-NPSS conference on Real time
A binary-tree architecture for scheduling real-time systems with hard and soft tasks
SBCCI'99 Proceedings of the XIIth conference on Integrated circuits and systems design
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
| Hi-index | 0.01 |
This paper addresses the problem of jointly scheduling tasks with both hard and soft real-time constraints. We present a new analysis applicable to systems scheduled using a priority preemptive dispatcher, with priorities assigned dynamically according to the EDF policy. Further, we present a new efficient on-line algorithm (the acceptor algorithm) for servicing aperiodic work load. The acceptor transforms a soft aperiodic task into a hard one by assigning a deadline. Once transformed, aperiodic tasks are handled in exactly the same way as periodic tasks with hard deadlines. The proposed algorithm is shown to be optimal in terms of providing the shortest aperiodic response time among fixed- and dynamic-priority schedulers. It always guarantees the proper execution of periodic hard tasks. The approach is composed of two parts: an off-line analysis and a run-time scheduler. The off-line algorithm runs in pseudopolynomial time O(mn), where n is the number of hard periodic tasks and m is the hyperperiod/min deadline.