DSpace Coleção: https://repositorio.ufba.br/handle/ri/34152 2026-05-04T03:29:26Z 2026-05-04T03:29:26Z Sufficient Schedulability Tests for EDF-Scheduled Real-Time Systems under Interference of a High Priority Task Santor-Jr., José Lima, George Marconi de Araújo https://repositorio.ufba.br/handle/ri/9291 2022-08-23T13:43:32Z 2013-11-01T00:00:00Z Título: Sufficient Schedulability Tests for EDF-Scheduled Real-Time Systems under Interference of a High Priority Task Autor(es): Santor-Jr., José; Lima, George Marconi de Araújo Abstract: We provide four new schedulability tests for a scheduling model according to which there is a high priority task concurrently executed with a set of EDF-scheduled tasks. All tests are proved correct and have their performance evaluated by simulation. Editora / Evento / Instituição: Sociedade Brasileira de Computação Tipo: Artigo de Evento 2013-11-01T00:00:00Z On the processor utilization bound of the C=D Scheduling Algorithm Santos Júnior, José Lima, George Marconi de Araújo Bletsas, Konstantinos https://repositorio.ufba.br/handle/ri/9290 2022-07-05T17:02:57Z 2013-03-01T00:00:00Z Título: On the processor utilization bound of the C=D Scheduling Algorithm Autor(es): Santos Júnior, José; Lima, George Marconi de Araújo; Bletsas, Konstantinos 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. Editora / Evento / Instituição: CreateSpace Independent Publishing Platform Tipo: Capítulo de Livro 2013-03-01T00:00:00Z