Hard Real-Time Computing Systems
Predictable Scheduling Algorithms and Applications
Page
%P
46 Result(s)
within
Giorgio Buttazzo
Engineering
-
Chapter
Basic Concepts
Over the last few years, several algorithms and methodologies have been proposed in the literature to improve the predictability of real-time systems. In order to present these results, we need to define some ...
-
Chapter
Periodic Task Scheduling
In many real-time control applications, periodic activities represent the major computational demand in the system. Periodic tasks typically arise from sensory data acquisition, low-level servoing, control loo...
-
Chapter
Dynamic Priority Servers
In this chapter we discuss the problem of scheduling soft aperiodic tasks and hard periodic tasks under dynamic priority assignments. In particular, different service methods are introduced, whose objective is...
-
Chapter
Limited Preemptive Scheduling
The question whether preemptive systems are better than non-preemptive systems has been debated for a long time, but only partial answers have been provided in the real-time literature, and still some issues r...
-
Chapter
Application Design Issues
This chapter discusses some crucial issues related to the design and the development of complex real-time applications requiring sensory acquisition, control, and actuation of mechanical components. The aim of...
-
Chapter
Real-Time Operating Systems and Standards
This chapter presents a brief overview of the state of art of real-time systems and standards. We first discuss the most common operating systems standard interfaces that play a major role for develo** porta...
-
Chapter
A General View
Real-time systems are computing systems that must react within precise time constraints to events in the environment. As a consequence, the correct behavior of these systems depends not only on the value of th...
-
Book
-
Chapter
Aperiodic Task Scheduling
In this chapter we present a variety of algorithms for scheduling real-time aperiodic tasks on a single machine environment. Each algorithm represents a solution for a particular scheduling problem, which is ...
-
Chapter
Fixed-Priority Servers
The scheduling algorithms treated in the previous chapters deal with homogeneous sets of tasks, where all computational activities are either aperiodic or periodic. Many real-time control applications, however...
-
Chapter
Resource Access Protocols
A resource is any software structure that can be used by a process to advance its execution. Typically, a resource can be a data structure, a set of variables, a main memory area, a file, or a set of registers of...
-
Chapter
Handling Overload Conditions
This chapter deals with the problem of scheduling real-time tasks in overload conditions, that is, in those critical situations in which the computational demand requested by the task set exceeds the processor...
-
Chapter
Kernel Design Issues
In this chapter, we present some basic issues that should be considered during the design and the development of a hard real-time kernel for critical control applications. For didactical purposes, we illustrat...
-
Chapter
Implementing Periodic Tasks in Linux
When learning real-time programming, one of the major difficulties is to face low-level details related to both the computing platform and the operating system, which require considerable programming effort, e...
-
Chapter
Solutions to the Exercises
Fast computing tends to minimize the average response time of computation activities, whereas real-time computing is required to guarantee the timing constraints of each task.
-
Article
Integrated Framework for Fast Prototy** and Testing of Autonomous Systems
Validating the behavior of a complex system is a fundamental step in the development process to avoid costly damages and dangerous circumstances. Such a phase requires a realistic simulation of the system and ...
-
Living Reference Work Entry In depth
Adaptive Methods for Handling Overload Conditions in Real-Time Embedded Systems
Control software in cyber-physical systems is becoming more complex than ever and difficult to analyze for all possible combinations of events that can occur during operation. One of the consequences of such a...
-
Article
Coverage Path Planning for UAVs Photogrammetry with Energy and Resolution Constraints
Unmanned Aerial Vehicles (UAVs) are starting to be used for photogrammetric sensing of large areas in several application domains, such as agriculture, rescuing, and surveillance. In this context, the problem ...
-
Book
-
Chapter
Density-Based Global Schedulability Tests
Most of the utilization-based schedulability tests presented in Chaps. 7–9 concerning the global scheduling of systems of implicitdeadline tasks can be generalized to the constrained- and arbitrarydeadline sys...
