Por favor, use este identificador para citar o enlazar este ítem:
https://repositorio.ufba.br/handle/ri/9290
metadata.dc.type: | Capítulo de Livro |
Título : | On the processor utilization bound of the C=D Scheduling Algorithm |
Autor : | Santos Júnior, José Lima, George Marconi de Araújo Bletsas, Konstantinos |
metadata.dc.creator: | Santos Júnior, José Lima, George Marconi de Araújo Bletsas, Konstantinos |
Resumen : | 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. |
Palabras clave : | real-time systems multiprocessor scheduling least utilization bound |
Editorial : | CreateSpace Independent Publishing Platform |
URI : | http://www.repositorio.ufba.br/ri/handle/ri/9290 |
Fecha de publicación : | mar-2013 |
Aparece en las colecciones: | Livro e Capítulo (PGCOMP) |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
0root.pdf | 143,24 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.