https://repositorio.ufba.br/handle/ri/9292
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.advisor | Lima, George Marconi de Araújo | - |
dc.contributor.author | Regnier, Paul Denis Etenne | - |
dc.contributor.author | Lima, George Marconi de Araújo | - |
dc.contributor.author | Massa, Ernesto | - |
dc.contributor.author | Levin, Greg | - |
dc.contributor.author | Brandt, Scott | - |
dc.creator | Regnier, Paul Denis Etenne | - |
dc.creator | Lima, George Marconi de Araújo | - |
dc.creator | Massa, Ernesto | - |
dc.creator | Levin, Greg | - |
dc.creator | Brandt, Scott | - |
dc.date.accessioned | 2013-03-28T13:55:21Z | - |
dc.date.available | 2013-03-28T13:55:21Z | - |
dc.date.issued | 2012-11 | - |
dc.identifier.issn | 0922-6443 | - |
dc.identifier.uri | http://www.repositorio.ufba.br/ri/handle/ri/9292 | - |
dc.description.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. | pt_BR |
dc.description.sponsorship | UFBA (Edital PROPI); CNPq (Edital Universal); CAPES (Bolsa doutorando) | pt_BR |
dc.publisher | Springer | pt_BR |
dc.subject | Real-time | pt_BR |
dc.subject | Multiprocessor | pt_BR |
dc.subject | Scheduling | pt_BR |
dc.subject | Server | pt_BR |
dc.title | Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach | pt_BR |
dc.type | Artigo de Periódico | pt_BR |
Aparece nas coleções: | Artigo Publicado em Periódico (PGCOMP) |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.