Scheduling periodic tasks on uniform multiprocessors
Sanjoy Baruah
Abstract
Sanjoy Baruah
Abstract
A uniform multiprocessor machine is comprised of an integer number of processors. Each processor P is characterized by a computing capacity P.c, with the interpretation that a job j executing on a processor P for t time units completes (P/sub j/.c/spl times/t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor systems is considered.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A uniform multiprocessor machine is comprised of an integer number of processors. Each processor P is characterized by a computing capacity P.c, with the interpretation that a job j executing on a processor P for t time units completes (P/sub j/.c/spl times/t) units of execution. The scheduling of systems of periodic tasks on uniform multiprocessor systems is considered.
Key concepts: Multiprocessing, Parallel computing, Computer science, Multiprocessor scheduling, Processor scheduling, Scheduling (production processes), Dynamic priority scheduling, Operating system