Please use this identifier to cite or link to this item: https://repositorio.ufba.br/handle/ri/9292
metadata.dc.type: Artigo Publicado em Periódico
Title: Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach
Authors: Regnier, Paul Denis Etenne
Lima, George Marconi de Araújo
Massa, Ernesto
Levin, Greg
Brandt, Scott
metadata.dc.creator: Regnier, Paul Denis Etenne
Lima, George Marconi de Araújo
Massa, Ernesto
Levin, Greg
Brandt, Scott
Abstract: 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.
Keywords: Real-time
Multiprocessor
Scheduling
Server
Publisher: Springer
URI: http://www.repositorio.ufba.br/ri/handle/ri/9292
Issue Date: Nov-2012
Appears in Collections:Artigo Publicado em Periódico (PGCOMP)

Files in This Item:
File Description SizeFormat 
RUN-ExtVers.pdf1,6 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.