The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
The design of the spring kernel
Tutorial: hard real-time systems
Inherently stable priority list scheduling in an extended scheduling environment
Inherently stable priority list scheduling in an extended scheduling environment
Production and Stabilization of Real-Time Task Schedules
Journal of the ACM (JACM)
Formal Design and Verification of a Reliable Computing Platform for Real-Time Control (Phase 2 Results)
| Hi-index | 0.00 |
This paper concerns the problem of scheduling instability, where reducing the duration of one or more tasks delays the starting time of another task. This can make it difficult or impossible to guarantee real-time deadlines. Unfortunately, simulating schedules with all possible variations in the durations of all tasks is in most cases an intractable problem. Therefore, task dispatching must be provably stable for all permissible variations in durations. To alleviate scheduling instability, we have developed a new class of provably stable runtime dispatchers that are less restrictive than known stabilization algorithms. Extensive simulations show that even the simple, low-overhead dispatchers perform remarkably well. These results suggest that "simple is better". Developers of hard real-time systems can implement fast, simple low-overhead runtime task dispatchers that guarantee stability but still deliver near-optimal performance.