On-line scheduling on uniform multiprocessors

Abstract The rate-monotonic algorithm is arguably one of the most popular algorithms for scheduling systemsof 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 whethera 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 schedulingupon identical multiprocessor platforms