With the progress of the technology, the presence of transient faults (e.g. bit-flipping errors) in cache memories becomes a challenge, especially in embedded real-time systems. These are mission critical systems that are often subject ...

Commercial-off-the-shelf (COTS) platforms feature several cores that share and contend for memory resources. In real-time system applications, it is of paramount importance to correctly estimate tight upper bounds to the delays due to memory contention. ...

Computing platforms for next-generation cyber–physical systems are evolving towards heterogeneous architectures comprising different processing elements and hardware accelerators. In particular, SoC-FPGA platforms, including multiple ...

• Cyber-physical systems demand complex computing workloads with real-time constraints;

The network-on-chip (NoC) provides a viable solution to bus-contention problems, that occur in classical manycore architectures. However, NoC complex design requires a particular attention to support the execution of real-time workloads. In this paper, we ...

Real-time languages found in the literature, starting with Esterel up to Timed C, cannot be compiled using off-the-shelf C++ compilers and processed by off-the-shelf C++ tools (e.g., editors, debuggers, program analyzers). Since C++ is one of the de ...

Parametric Worst-case execution time (WCET) analysis of a sequential program produces a formula that represents the worst-case execution time of the program, where parameters of the formula are user-defined parameters of the program (as loop bounds, ...

In this paper, we address the problem of executing (soft) real-time data processing applications on heterogeneous computing platforms with the goal of reducing the energy consumption. The typical application domain is edge computing (or fog computing), ...

Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from ...

We address the problem of schedulability analysis for a set of sporadic real-time tasks scheduled by the Global Earliest Deadline First (G-EDF) policy on a multiprocessor platform. State-of-the-art tests for schedulability analysis of multiprocessor ...

In this paper we present an exact schedulability test for sporadic real-time tasks scheduled by the Global Fixed Priority (G-FP) Fully Preemptive Scheduler on a multiprocessor system. The analysis consists in modelling the system as a Linear Hybrid ...

Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from ...

The Multiprocessor Bandwidth Inheritance (M-BWI) protocol is an extension of the Bandwidth Inheritance (BWI) protocol for symmetric multiprocessor systems. Similar to Priority Inheritance, M-BWI lets a task that has locked a resource execute in the ...

Highlights Experimental comparison among RM and EDF on multi-processors. Comparison made with partitioned, clustered and global policies. Random workloads of synthetic periodic tasks. Experimentation carried out on a 48-core machine with Linux. ...

Adaptive reservation is a real-time scheduling technique in which each application is associated a fraction of the computational resource (a reservation) that can be dynamically adapted to the varying requirements of the application by using appropriate ...

We propose an adaptive scheduling technique to schedule highly dynamic multimedia tasks on a CPU. We use a combination of two techniques: the first one is a feedback mechanism to track the resource requirements of the tasks based on “local” ...

Hierarchical Scheduling (HS) systems manage a set of realtime applications through a scheduling hierarchy, enabling partitioning and reduction of complexity, confinement of failure modes, and temporal isolation among system applications. This plays a ...

Management, allocation and scheduling of heterogeneous resources for complex distributed real-time applications is a challenging problem. Timing constraints of applications may be fulfilled by the proper use of real-time scheduling policies, admission ...

In many scenarios, such as in the automotive context [1], [2], the complexity of developing a distributed real-time embedded (DRE) system is reduced by dividing the system into separate components, possibly developed by a different teams or third-party ...

In distributed real-time embedded systems (DRE), it is common to model an application as a set of task chains. Each chain is activated cyclically and must complete before an end-to-end deadline. Each task of the chain is bound to execute on a particular ...