Template schedule construction for global real-time scheduling on unrelated multiprocessor platforms

Bertout, Antoine; Goossens, Joël; Grolleau, Emmanuel; Poczekajlo, Xavier

doi:10.23919/date48585.2020.9116409

Cited by 11 publications

(6 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposal extends the optimal Hetero-Fair algorithm [202] to be applied on generic heterogeneous platforms consisting of more than two processor types. Bertout et al [203] proposed and proved a novel and efficient algorithm to build the second step of the feasibility analysis of preemptive real-time systems upon heterogeneous multiprocessor platforms presented by Baruah [204]. Nair et al [205] presented a standby-sparing based fault-tolerant energy-aware scheduling strategy for heterogeneous systems.…”

Section: Schedulability Analysis Techniquesmentioning

confidence: 99%

A Survey of Techniques for Reducing Interference in Real-Time Applications on Multicore Platforms

et al. 2022

View full text Add to dashboard Cite

This survey reviews the scientific literature on techniques for reducing interference in real-time multicore systems, focusing on the approaches proposed between 2015 and 2020. It also presents proposals that use interference reduction techniques without considering the predictability issue. The survey highlights interference sources and categorizes proposals from the perspective of the shared resource. It covers techniques for reducing contentions in main memory, cache memory, a memory bus, and the integration of interference effects into schedulability analysis. Every section contains an overview of each proposal and an assessment of its advantages and disadvantages.INDEX TERMS Real-time systems, architecture, multicore, timing analysis, schedulability analysis, WCET, co-runner interference.

show abstract

Section: Schedulability Analysis Techniquesmentioning

confidence: 99%

A Survey of Techniques for Reducing Interference in Real-Time Applications on Multicore Platforms

et al. 2022

View full text Add to dashboard Cite

show abstract

“…A way to reduce the size of the LPP upon a DP basis appears in [24] (which corrects [25]). The proposal is thermal and energy-agnostic but provides a necessary and sufficient schedulability condition.…”

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

“…Here, the goal is to improve the parallel execution efficiency of tasks that share resources (e.g., external devices, shared memory, and files). To solve this problem, there exist multiple paradigms, such as a Partitioned Schedule [43], [45], a Global Schedule [46], and a Semi-partitioned Schedule [44].…”

Section: A Balanced Partition (Bp)mentioning

confidence: 99%

Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites

et al. 2021

View full text Add to dashboard Cite

Combinatorial optimization problems (COPs) are paramount for real-life problems with discrete variables. Even though the number of combinations is finite, some problems exhibit exponential growth, rendering exact approaches unfeasible. So, approximate methods, such as heuristics, are customary for making fast decisions. Despite their small computational cost, each heuristic specializes in specific kinds of problems. Hence, other approaches have appeared for merging their strengths. One of these approaches is commonly known as selection hyper-heuristics. However, a trained hyper-heuristic usually carries the following problem: it provides scarce information about its sensitivity. This makes it more difficult to estimate the effect of changing a parameter. Illumination algorithms seek to improve this issue by focusing on exploration rather than on exploitation while preserving information about the best solutions with different criteria. Still, literature falls short when merging both approaches, representing a knowledge gap. Therefore, in this work, we test the feasibility of using an illumination algorithm, the MAP-Elites (ME), for tuning a sequence-based selection hyper-heuristic model for Balanced Partition problems. We choose ME since it has been successfully applied to a different COP, and by linking it with hyper-heuristics, we may exploit upon its benefits. So, we may achieve a hyper-heuristic that represents the best combination of heuristics. Simultaneously, we can gain information about the expected performance of diverse hyperheuristics, e.g., those that begin with a different heuristic. Our approach operates by creating a multidimensional map, where each design variable represents the application of a given heuristic. Afterward, ME generates mutated sequences and tests them to determine if they represent a better-performing solution. To test our approach, we consider 1500 instances that include easy and hard instances, analyzed under different scenarios. We also include limit instances that are neither easy nor hard. Our resulting data supports the feasibility of the proposed approach. We show that this kind of hyper-heuristic can perform toe-to-toe with a synthetic oracle. Besides, under some conditions, the former may even outperform the latter. This represents an outstanding result, since such an oracle can only be obtained by a brute-force approach, and because it demonstrates that merging both approaches (ME and hyper-heuristics) is a path worth pursuing. We also present how each parameter affects the model performance, concluding that some parameters can be critical while others are virtually irrelevant. This is also a relevant result, since it serves as the groundwork for future works so that they can focus on exploiting the most relevant parameters.

show abstract

Template schedule construction for global real-time scheduling on unrelated multiprocessor platforms

Cited by 11 publications

References 15 publications

A Survey of Techniques for Reducing Interference in Real-Time Applications on Multicore Platforms

A Survey of Techniques for Reducing Interference in Real-Time Applications on Multicore Platforms

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

Sequence-Based Selection Hyper-Heuristic Model via MAP-Elites

Contact Info

Product

Resources

About