Decentralized Decision-Making for Task Reallocation in a Hard Real-Time System
IEEE Transactions on Computers
Algorithm-based fault tolerance for matrix inversion with maximum pivoting
Journal of Parallel and Distributed Computing
Enhancing fault-tolerance in rate-monotonic scheduling
Real-Time Systems - Special issue on responsive computer systems
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Minimum Achievable Utilization for Fault-Tolerant Processing of Periodic Tasks
IEEE Transactions on Computers
Fault-Tolerant Rate-Monotonic Scheduling
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Fault-Tolerant Deadline-Monotonic Algorithm for Scheduling Hard-Real-Time Tasks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Measuring the Performance of Schedulability Tests
Real-Time Systems
Rate monotonic schedulability tests using period-dependent conditions
Real-Time Systems
Generalized rate monotonic schedulability bounds using relative period ratios
Information Processing Letters
Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Comments on "Generalized rate monotonic schedulability bounds using relative period ratios"
Information Processing Letters
ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
| Hi-index | 14.98 |
Rate-monotonic scheduling (RMS) is a widely used real-time scheduling technique. This paper proposes RBound, a new admission control for RMS. RBound has two interesting properties. First, it achieves high processor utilization under certain conditions. We show how to obtain these conditions in a multiprocessor environment and propose a multiprocessor scheduling algorithm that achieves a near optimal processor utilization. Second, the framework developed for RBound remains close to the original RMS framework (that is, task dispatching is still done via a fixed-priority scheme based on the task periods). In particular, we show how RBound can be used to guarantee a timely recovery in the presence of faults and still achieve high processor utilization. We also show how RBound can be used to increase the processor utilization when aperiodic tasks are serviced by a priority exchange server or a deferrable server.