Use este identificador para citar ou linkar para este item:
https://repositorio.ufba.br/handle/ri/9290
Registro completo de metadados
Campo DC | Valor | Idioma |
---|---|---|
dc.contributor.author | Santos Júnior, José | - |
dc.contributor.author | Lima, George Marconi de Araújo | - |
dc.contributor.author | Bletsas, Konstantinos | - |
dc.contributor.editor | Audsley, Neil | - |
dc.contributor.editor | Baruah, Sanjoy | - |
dc.creator | Santos Júnior, José | - |
dc.creator | Lima, George Marconi de Araújo | - |
dc.creator | Bletsas, Konstantinos | - |
dc.date.accessioned | 2013-03-28T12:31:24Z | - |
dc.date.available | 2013-03-28T12:31:24Z | - |
dc.date.issued | 2013-03 | - |
dc.identifier.isbn | 1482707780 | - |
dc.identifier.uri | http://www.repositorio.ufba.br/ri/handle/ri/9290 | - |
dc.description.abstract | Under semi-partitioned multiprocessor scheduling some (or most) tasks are partitioned to the available processors while the rest may migrate between different processors, under a carefully managed scheme. One of the best performing and practical to implement EDF-based semi-partitioned algorithms is C=D splitting. Under this algorithm, each migrating task always executes at the highest-priority on all but one of the processors that it uses. This arrangement allows for efficient processor utilisation in general, however no tilisation bound had been published so far for this algorithm. We address this situation by deriving the utilisation bound of 13/18 for a variant of C=D with the following constraint: at most one migrating task may utilise each processor. We also draw additional conclusions for the utilisation bound attainable under a C=D task splitting scheme in the general case. | pt_BR |
dc.description.sponsorship | UFBA (Edital PROPI-2012), CNPq (Edital Universal) e CAPES (Bolsa de doutorado) | pt_BR |
dc.language.iso | en | pt_BR |
dc.publisher | CreateSpace Independent Publishing Platform | pt_BR |
dc.subject | real-time systems | pt_BR |
dc.subject | multiprocessor scheduling | pt_BR |
dc.subject | least utilization bound | pt_BR |
dc.title | On the processor utilization bound of the C=D Scheduling Algorithm | pt_BR |
dc.type | Capítulo de Livro | pt_BR |
dc.description.localpub | Inglaterra | pt_BR |
dc.identifier.number | Real-Time Systems: the past, the present and the future. 1a edição. | pt_BR |
Aparece nas coleções: | Livro e Capítulo (PGCOMP) |
Arquivos associados a este item:
Arquivo | Descrição | Tamanho | Formato | |
---|---|---|---|---|
0root.pdf | 143,24 kB | Adobe PDF | Visualizar/Abrir |
Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.