Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Dynamic scheduling of real-time tasks under precedence constraints
Real-Time Systems
Stack-based scheduling for realtime processes
Real-Time Systems
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
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Schedulability analysis of periodic and aperiodic tasks with resource constraints
Journal of Systems Architecture: the EUROMICRO Journal - Special issue on real-time systems
Robust aperiodic scheduling under dynamic priority systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Embedded Software in Network Processors - Models and Algorithms
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Real-time broadcast algorithm for mobile computing
Journal of Systems and Software
Quasi-Static Scheduling for Real-Time Systems with Hard and Soft Tasks
Proceedings of the conference on Design, automation and test in Europe - Volume 2
Adaptive scheduling for integrated traffic on WDM optical networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive scheduling server for power-aware real-time tasks
ACM Transactions on Embedded Computing Systems (TECS)
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
IEEE Transactions on Computers
Scheduling of fault-tolerant embedded systems with soft and hard timing constraints
Proceedings of the conference on Design, automation and test in Europe
The space of EDF deadlines: the exact region and a convex approximation
Real-Time Systems
Scalable real-time monitoring system for ubiquitous smart space
Information Processing Letters
Improving responsiveness of soft aperiodic tasks using proportional slack time
Computers and Electrical Engineering
A new fair scheduling algorithm for periodic tasks on multiprocessors
Information Processing Letters
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
| Hi-index | 14.98 |
In this paper, we present a new scheduling approach for servicing soft aperiodic requests in a hard real-time environment, where a set of hard periodic tasks is scheduled using the Earliest Deadline First algorithm. The main characteristic of the proposed algorithm is that it achieves full processor utilization and optimal aperiodic responsiveness, still guaranteeing the execution of the periodic tasks. Another interesting feature of the proposed algorithm is that it can easily be tuned to balance performance versus complexity for adapting it to different application requirements. Schedulability issues, performance results, and implementation complexity of the algorithm are discussed and compared with other methods, such as Background, the Total Bandwidth Server, and the Slack Stealer. Resource reclaiming and extensions to more general cases are also considered. Extensive simulations show that a substantial improvement can be achieved with a little increase of complexity, ranging from the performance of the Total Bandwidth Server up to the optimal behavior.