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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Proceedings (IEEE International Conference on Emerging Technologies and Factory Automation) s. 1 - 8
Hlavní autoři:	Gaspard, Thomas, Bertout, Antoine, Richard, Pascal, Goossens, Joel, Grolleau, Emmanuel
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 09.09.2025
Témata:	Embedded systems Manufacturing automation Optimal scheduling periodic tasks Real-time systems Resource management Schedules scheduling Time factors unfair scheduling uniform multiprocessor
ISSN:	1946-0759
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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