Artigo de Periódico
Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
Fecha
2012-11Autor
Regnier, Paul Denis Etenne
Lima, George Marconi de Araújo
Massa, Ernesto
Levin, Greg
Brandt, Scott
Regnier, Paul Denis Etenne
Lima, George Marconi de Araújo
Massa, Ernesto
Levin, Greg
Brandt, Scott
Institución
Resumen
Optimal multiprocessor real-time schedulers incur significant overhead for preemptions and migrations. We present RUN, an efficient scheduler that reduces the multiprocessor problem to a series of uniprocessor problems. RUN significantly outperforms existing optimal algorithms with an upper bound of O(logm) average preemptions per job on m processors (fewer than 3 per job in all of our simulated task sets) and reduces to Partitioned EDF whenever a proper partitioning is found.