Abstract
Each processor in a uniform multiprocessor ma- chine is characterized by a speed or computing capac- ity, with the interpretation that a job executing on a processor with speed s for t time units completes (s \times t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor platforms using the rate-monotonic scheduling algorithm is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by algorithm upon a particular uniform multiprocessor platform - this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.