Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Baruah et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: