Abstract
The rate-monotonic algorithm is arguably one of the most popular algorithms for scheduling systems of periodic real-time tasks. The rate-monotonic scheduling of systems of periodic tasks on uniform multiprocessor platforms is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by this algorithm upon a particular uniform multiprocessor platform-this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.
| Original language | English |
|---|---|
| Pages (from-to) | 966-970 |
| Number of pages | 5 |
| Journal | IEEE Transactions on Computers |
| Volume | 52 |
| Issue number | 7 |
| DOIs | |
| State | Published - Jul 2003 |
Keywords
- Global scheduling
- Periodic tasks
- Rate-monotonic algorithm
- Static priorities
- Uniform multiprocessors