The Carousel-EDF Scheduling Algorithm for Multiprocessor Systems

• Tipo: Artigo em Livro de Atas de Conferência Internacional
• Data: 2013

Autores

Paulo Baltarejo Sousa (Autor) Outra; Pedro Souto (Autor) FEUP; Eduardo Tovar (Autor) Outra; Konstantinos Bletsas (Autor) Outra

Ata de Conferência Internacional

Título: 2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2013

Páginas: 12-21

2013 IEEE 19th International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2013

Taipei, 19 August 2013 through 21 August 2013

Indexação

ISI Web of Knowledge - 3 Citações

Scopus - 7 Citações

COMPENDEX

Classificação Científica

CORDIS: Ciências Físicas > Ciência de computadores > Sistema de computadores

FOS: Ciências da engenharia e tecnologias > Engenharia electrotécnica, electrónica e informática

Outras Informações

ID Authenticus: P-009-37E

DOI: 10.1109/RTCSA.2013.6732199

Abstract (EN): We present Carousel-EDF, a new hierarchical scheduling algorithm for a system of identical processors, and its overhead-aware schedulability analysis based on demand bound functions. Carousel-EDF is an offshoot of NPS-F and preserves its utilization bounds, which are the highest among algorithms not based on a single dispatching queue and that have few preemptions. Furthermore, with respect to NPS-F, Carousel-EDF reduces by up to 50% the number of context switches and of preemptions caused by the high-level scheduler itself. The schedulability analysis we present in this paper is grounded on a prototype implementation of Carousel-EDF that uses a new implementation technique for the release of periodic tasks. This technique reduces the pessimism of the schedulability analysis presented and can be applied, with similar benefits, to other scheduling algorithms such as NPS-F.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 10