The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—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.</p>
Uniform multiprocessors; periodic tasks; global scheduling; static priorities; rate-monotonic algorithm.
Sanjoy K. Baruah, Jo? Goossens, "Rate-Monotonic Scheduling on Uniform Multiprocessors", IEEE Transactions on Computers, vol. 52, no. , pp. 966-970, July 2003, doi:10.1109/TC.2003.1214344
79 ms
(Ver 3.3 (11022016))