Non-preemptive multiprocessor scheduling for periodic real-time tasks

Mayank, Jaishree; Mondal, Arijit

doi:10.1109/ised.2017.8303931

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Content may change prior to final publication. the RT multiprocessor scheduling problem is [33]. They solve the BPP for allocating tasks to processors according to clusters of a given size.…”

Section: Related Workmentioning

confidence: 99%

Maximizing Utilization and Minimizing Migration in Thermal-Aware Energy-Efficient Real-Time Multiprocessor Scheduling

et al. 2021

View full text Add to dashboard Cite

This work proposes CAlECs, a clustered scheduling system for MPSoCs subject to thermal and energy constraints. It calculates off-line a cyclic executive honoring temporal and thermal constraints, for a hard real-time (HRT) task set at minimum frequency to reduce consumed energy, minimizing context switches and migrations. It also provides an on-line controller able to manage system and task parametric variations and soft real-time (SRT) tasks, always meeting the HRT task set constraints and the system thermal bound. CAlECS maximizes CPU utilization to help avoid overprovisioning contributing to a low SWaP factor. Its modular design allows the utilization of different modeling and scheduling approaches, and makes the off-line and on-line components independent from each other to better suit the requirements of a specific system. We experimentally show that the cyclic executive provided by CAlECS for HRT task sets outperforms RUN, a reference off-line algorithm in terms of optimal number of context switches.

show abstract

Section: Related Workmentioning

confidence: 99%