• Corpus ID: 1762058

On the periodic behavior of real-time schedulers on identical multiprocessor platforms

@article{Grolleau2013OnTP,
  title={On the periodic behavior of real-time schedulers on identical multiprocessor platforms},
  author={Emmanuel Grolleau and Jo{\"e}l Goossens and Liliana Cucu-Grosjean},
  journal={ArXiv},
  year={2013},
  volume={abs/1305.3849}
}
This paper is proposing a general periodicity result concerning any deterministic and memoryless scheduling algorithm (including non-work-conserving algorithms), for any context, on identical multiprocessor platforms. By context we mean the hardware architecture (uniprocessor, multicore), as well as task constraints like critical sections, precedence constraints, self-suspension, etc. Since the result is based only on the releases and deadlines, it is independent from any other parameter. Note… 
View PDF on arXiv
7 Citations
Background Citations
4

Figures from this paper

7 Citations

A pre-order relation for exact schedulability test of sporadic tasks on multiprocessor Global Fixed-Priority scheduling
TLDR
It is proved that the schedulability analysis problem is decidable, and a formula for computing the decidability interval is provided, for the first time such a time interval is proposed for sporadic tasks running on multiprocessor.
Off-line mapping of multi-rate dependent task sets to many-core platforms
TLDR
The paper details the approach to automatically compute a valid mapping of the application to the platform and evaluates the approach, which is based on constraint programming, by applying it to several task sets that are derived from industrial applications.
Contributions to real-time systems
TLDR
The perspectives of the results and the vision of how these results will modify the real-time community that needs to face data deluge and increased connectivity with less critical systems that will coexist within onelarger system built following a mixed-critical model are presented.
Automatic parallelization and scheduling approaches for co-simulation of numerical models on multi-core processors
TLDR
This thesis builds on the RCOSIM approach that has been previously developed at IFP Energies nouvelles and which allows the parallelization of FMI models on multi-core processors and proposes algorithms for the allocation and non preemptive scheduling of the dependence graphs, taking into account their real-time, data dependence and allocation constraints.
Saving energy without defying deadlines on mobile GPU-based heterogeneous systems
TLDR
This paper proposes an approach to utilize both the GPU and the CPU in a heterogeneous fashion to meet the deadlines of a real-time application while ensuring that the authors maximize the energy savings.
Scheduling Real-Time HiL Co-Simulation of Cyber-Physical Systems on Multi-Core Architectures
  • S. Saidi, N. Pernet, Y. Sorel
  • Computer Science
    2018 IEEE 24th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)
  • 2018
TLDR
An ILP formulation as well as a heuristic are proposed to solve the problem of scheduling the co-simulation on a multicore architecture while satisfying the previously defined real-time constraints.
Programmation sûre de plates-formes embarquées de type multi/pluri-cœurs. (Programming mutli/many-core COTS for critical embedded systems)
L’objectif de ce document est de decrire une synthese des travaux que j’ai menes autour du theme de "la programmation sure de plates-formes embarquees" et de proposer des perspectives de recherche…

References

SHOWING 1-10 OF 24 REFERENCES
Feasibility Intervals for Fixed-Priority Real-Time Scheduling on Uniform Multiprocessors
TLDR
This paper studies the global scheduling of periodic task systems upon uniform multiprocessor platforms and shows that any feasible schedules of asynchronous periodic task sets using a fixed-priority scheduler are periodic from a specific point.
Feasibility Intervals for Multiprocessor Fixed-Priority Scheduling of Arbitrary Deadline Periodic Systems
TLDR
This paper presents the main result: any feasible schedule of asynchronous periodic task sets using a fixed-priority scheduler is periodic from a specific point and is characterized to provide a feasibility interval for those systems.
Static-priority scheduling on multiprocessors
TLDR
It is proven that this scheduling algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm and successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocesser platform.
Exact schedulability tests for real-time scheduling of periodic tasks on unrelated multiprocessor platforms
Scheduling algorithms for multiprogramming in a hard-real-time environment
The problem of multiprogram scheduling on a single processor is studied from the viewpoint of the characteristics peculiar to the program functions that need guaranteed service. It is shown that an…
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
TLDR
The preemptive scheduling of periodic, real-time task systems on one processor is investigated, and it is shown that for incomplete task systems, that is, task systems in which the start times are not specified, the feasibility problem is ∑2p-complete.
Exact and approximate supply bound function for multiprocessor periodic resource model: unsynchronized servers
TLDR
The MPR model is extended such that the execution of virtual processors (servers) is not assumed to be synchronized i.e., the servers can have different phases.
A survey of hard real-time scheduling for multiprocessor systems
TLDR
The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed, and provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes.
Efficient partitioning of sporadic real-time tasks with shared resources and spin locks
TLDR
This ILP formulation is the first optimal solution to the mapping problem in the presence of spin locks, and a new resource-aware partitioning heuristic is introduced, which, while not optimal, is efficient in the sense that it easily scales to large problem instances.
A Categorization of Real-Time Multiprocessor Scheduling Problems and Algorithms
TLDR
This chapter analyzes the trade-offs involved in scheduling independent, periodic real-time tasks on a multiprocessor.
...
...