Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

@inproceedings{Buttazzo1997HardRC,
  title={Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications},
  author={Giorgio C. Buttazzo},
  year={1997}
}
Real Time Computing Systems
TLDR
In the paper, various scheduling techniques are analyzed and the various issues on which there is still a need to work are observed.
Real-Time Operating Systems: Problems and Novel Solutions
TLDR
This work presents some methodologies for enhancing predictability in real-time computing systems, where explicit timing constraints have to be enforced on application processes, and introduces a novel approach for handling transient overloads and execution overruns in soft real- time systems working in dynamic environments.
Scheduling Algorithms for Real-Time Systems
TLDR
A formal definition for real-time systems is provided and a tight upper bound for the optimal solution to the problem is obtained, which proves the properties of any optimal scheduling algorithm.
Robust scheduling of real-time applications on efficient embedded multicore systems
TLDR
A task set extension is proposed, which defines complex task activation patterns and the variation of non-preemptive parts of the task execution time in multicore real-time scheduling algorithms Partly-Pfair-PD² and P-ERfair- PD².
A Survey on Scheduling Approaches for Hard Real-Time Systems
TLDR
This paper surveyed the basic hard RTS scheduling algorithms that guarantee the on-time completion of the tasks and contains the different heuristic and partitioned approaches for some specific factors of real-time systems such as energy consumption, dependability, performance, scheduling feasibility and utilization of memory resource.
Hardware Accelerated Scheduling in Real-Time Systems
TLDR
This work proposes a scalable hardware representation of task scheduler in a form of coprocessor based on EDF algorithm that can help real-time systems to have more tasks that meet their deadlines while keeping high CPU utilisation and system determinism.
No . 2005-499 Scheduling Algorithms for Real-Time Systems ∗
TLDR
This paper studies the characteristics and constraints of real-time tasks which should be scheduled to be executed, and describes techniques to deal with ap eriodic and sporadic tasks, precedence constraints, and priority inversion.
Interactive Simulation and Test Environment for Real-Time Scheduling
TLDR
An interactive simulation and test environment for real-time scheduling (I-SITER) has been implemented and is being used throughout real- time systems and computer science courses taught at the Carinthia Tech Institute.
An Analysis of Scheduling Algorithms in Real-Time Operating System
TLDR
The classification of several scheduling techniques has been done based on different parameters and comparison between various scheduling techniques have been done.
Concurrent Real-time Schedulers, a Classification Based on Functions
TLDR
A RTTCS is a function that maps the Set of Arrival Times (ATS) to the Starting Times Set (STS) of the instances related to CRTTS, and it will be useful to define the working environment of RTS in the analysis of schedulability, reconstruction, fail-safe and predictability.
...
...