Abstract
One of the most well-studied scheduling algorithms for real-time systems is the Rate Monotonic (RM) scheduling for periodic tasks. In this paper we derive a generalized RM schedulability bound by considering relative period ratios among tasks in a system. We show that schedulability bounds published earlier are special cases of our generalized bound. Our new bound may provide a higher value than earlier results.
| Original language | English |
|---|---|
| Pages (from-to) | 142-148 |
| Number of pages | 7 |
| Journal | Information Processing Letters |
| Volume | 107 |
| Issue number | 5 |
| DOIs | |
| State | Published - 16 08 2008 |
| Externally published | Yes |
Keywords
- Rate monotonic analysis
- Real-time systems
- Schedulability conditions