An unfair optimal scheduling algorithm for uniform multiprocessors

This paper introduces unfair-PCG, the first unfair optimal scheduling algorithm for periodic implicit-deadline tasks on uniform multiprocessor platforms. The approach leverages the TL-plane scheduling method, allowing tasks to execute beyond their local execution time if processing resources are ava...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings (IEEE International Conference on Emerging Technologies and Factory Automation) pp. 1 - 8
Main Authors: Gaspard, Thomas, Bertout, Antoine, Richard, Pascal, Goossens, Joel, Grolleau, Emmanuel
Format: Conference Proceeding
Language:English
Published: IEEE 09.09.2025
Subjects:
ISSN:1946-0759
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper introduces unfair-PCG, the first unfair optimal scheduling algorithm for periodic implicit-deadline tasks on uniform multiprocessor platforms. The approach leverages the TL-plane scheduling method, allowing tasks to execute beyond their local execution time if processing resources are available. The algorithm ensures optimal resource utilisation while meeting task deadlines, thereby enhancing response times and enabling power-saving mechanisms.
ISSN:1946-0759
DOI:10.1109/ETFA65518.2025.11205723