Global Scheduling Not Required: Simple, Near-Optimal Multiprocessor Real-Time Scheduling with Semi-Partitioned Reservations

Brandenburg, Björn B.; Gul, Mahircan

doi:10.1109/rtss.2016.019

Cited by 63 publications

(40 citation statements)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, the results of this paper provide new food for thought concerning the need for global scheduling in managing real-time workload, which has recently been questioned in recent works [16,18] by showing that simple semi-partitioned scheduling can achieve very high schedulability performance. The considered tests for global scheduling also found a questionable application in the context of dynamic workload: since the partitioning scheme that dominates them is very simple, the same worst-case performance may be guaranteed by employing efficient algorithms for on-line task re-partitioning, with a resulting reduction of run-time overhead in steady-state conditions.…”

Section: Discussionmentioning

confidence: 97%

On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling

Biondi

Sun

2018

Real-Time Syst

View full text Add to dashboard Cite

Enormous efforts have been spent in the derivation of sufficient schedulability tests for popular global schedulers such as global fixed-priority (G-FP) and global earliest-deadline first (G-EDF). Among all the proposals, response-time analysis techniques are established as the most popular ones and have been widely adopted by several authors in subsequent researches. Such tests are based on interference bounds that have been derived by exploiting the work-conserving property of such schedulers, and are typically expressed with a 1/m multiplier in the interference equation (with m being the number of available processors).

show abstract

Section: Discussionmentioning

confidence: 97%

On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling

Biondi

Sun

2018

Real-Time Syst

View full text Add to dashboard Cite

show abstract

“…In the core of our article, we have neglected the context switch delay in EDF incurred by a preemption. This cost is orders of magnitude less than the cost of executing a job [4,7,8]. Nevertheless, in the following, we present a solution where we take into account this context switch delay.…”

Section: Taking Into Account the Cost Of Context Switchesmentioning

confidence: 99%

Dynamic speed scaling minimizing expected energy consumption for real-time tasks

Gaujal

Girault

Plassart

2020

J Sched

View full text Add to dashboard Cite

This paper proposes a Discrete Time Markov Decision Process (MDP) approach to compute the optimal on-line speed scaling policy to minimize the energy consumption of a single processor executing a finite or infinite set of jobs with real-time constraints. We provide several qualitative properties of the optimal policy: monotonicity with respect to the jobs parameters, comparison with on-line deterministic algorithms. Numerical experiments in several scenarios show that our proposition performs well when compared with off-line optimal solutions and out-performs on-line solu-This work has been partially supported by the LabEx PERSYVAL-Lab.

show abstract

“…However, RT task scheduling on multiprocessors is far more challenging than traditional RT scheduling on uniprocessors. Although it is possible to find practical solutions for specific cases, considering thermal restrictions, optimizing energy or dealing with resource sharing are still open questions ( [6]). We have been exploring the design of Thermal-Aware RT Schedulers in recent contributions, leveraging control techniques and combining fluid and combinatorial schedulers, taking the most of both approaches ( [15]).…”

Section: Introductionmentioning

confidence: 99%

“…Alternatively, semipartitioned scheduling preforms a preliminary static allocation of some tasks over the whole set of available CPUs, allowing the rest of them to migrate ( [19]). Recently, [6] and [9] leverage this technique to lowering migrations. In order to test the performance of such schedulers and new ones in early stages, the herein proposed simulation framework is a powerful tool.…”

Section: Introductionmentioning

confidence: 99%

A Flexible Framework for Real-Time Thermal-Aware Schedulers using Timed Continuous Petri Nets

López

Anguiano

Treviño

et al. 2019

CyS

View full text Add to dashboard Cite

This work presents TCPN-ThermalSim, a software tool for testing Real-Time Thermal-Aware Schedulers 1 . This framework consists of four main modules. The first one helps the user to define the problem: task set with periods, deadlines and worst case execution times in CPU cycles, along with the CPU characteristics, temperature and energy consumption. The second module is the Kernel simulation, which builds up a global simulation model according to the configuration module. In the third module, the user selects the scheduler algorithm.Finally the last module allows the execution of the simulation and present the results. The framework encompasses two modes: manual and automatic. In manual mode the simulator uses the task set data provided in the first section. In automatic mode the task set is generated by parameterizing the integrated UUniFast algorithm.

show abstract

Global Scheduling Not Required: Simple, Near-Optimal Multiprocessor Real-Time Scheduling with Semi-Partitioned Reservations

Cited by 63 publications

References 40 publications

On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling

On the ineffectiveness of 1/m-based interference bounds in the analysis of global EDF and FIFO scheduling

Dynamic speed scaling minimizing expected energy consumption for real-time tasks

A Flexible Framework for Real-Time Thermal-Aware Schedulers using Timed Continuous Petri Nets

Contact Info

Product

Resources

About