The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Elastic Scheduling for Flexible Workload Management
IEEE Transactions on Computers
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Aperiodic Servers with Resource Constraints
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Hierarchical Fixed Priority Pre-Emptive Scheduling
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
Real-Time Systems
Resource Sharing in Hierarchical Fixed Priority Pre-Emptive Systems
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Modeling Device Driver Effects in Real-Time Schedulability Analysis: Study of a Network Driver
RTAS '07 Proceedings of the 13th IEEE Real Time and Embedded Technology and Applications Symposium
The Design of an EDF-Scheduled Resource-Sharing Open Environment
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
IEEE Transactions on Parallel and Distributed Systems
An implementation of the earliest deadline first algorithm in Linux
Proceedings of the 2009 ACM symposium on Applied Computing
Capacity sharing for overrun control
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
| Hi-index | 0.00 |
The Sporadic Server (SS) overcomes the major limitations of other Resource Reservation Fixed Priority based techniques, but it also presents some drawbacks, mainly related to an increased scheduling overhead and a not so efficient behavior during overrun situations. In this paper we introduce and prove the effectiveness of an improved SS with reduced overhead and fairer handling of server overrun situations. We also show how this can be efficiently exploited to provide temporal isolation in a multiprocessor platform, adapting already existing schedulability tests.