The Carousel-EDF Scheduling Algorithm for Multiprocessor Systems

• Type: Article in International Conference Proceedings Book
• Date: 2013

Authors

Paulo Baltarejo Sousa (Author) Other; Pedro Souto (Author) FEUP; Eduardo Tovar (Author) Other; Konstantinos Bletsas (Author) Other

Conference proceedings International

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

Pages: 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

Indexing

ISI Web of Knowledge - 3 Citations

Scopus - 7 Citations

COMPENDEX

Scientific classification

CORDIS: Physical sciences > Computer science > Computer systems

FOS: Engineering and technology > Electrical engineering, Electronic engineering, Information engineering

Other information

Authenticus ID: 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.

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 10