No abstract available.
Proceeding Downloads
Enabling timing predictability in the presence of store buffers
We study the effect of store buffers on the timing predictability of processor pipelines. We show that the concurrency between the load unit and the store buffer to access the memory bus is an obstacle to timing predictability, even in simple scalar in-...
WCET analysis with procedure arguments as parameters
Parametric Worst-Case Execution Time (WCET) is a static analysis that computes a WCET formula that depends on various parameters. The formula can be used off-line for fast parameter space exploration, and on-line for adaptive scheduling.
In this work, ...
Analysis of Shared Cache Interference in Multi-Core Systems using Event-Arrival Curves
Caches are used to bridge the gap between main memory and the significantly faster processor cores. In multi-core architectures, the last-level cache is often shared between cores. However, sharing a cache causes inter-core interference to emerge. ...
B-TSP: An Advanced Power Safe Management Strategy for modern Multi-core Platforms under Thermal-Aware Design
Thermal management is a crucial aspect of the design and operation of safety-critical multi-core architectures, as their high power density can cause significant heat generation and risk of thermal overload. If not properly managed, thermal overload can ...
Characterizing G-EDF scheduling tardiness with uniform instances on multiprocessors
Soft real-time multiprocessor systems frequently adopt the G-EDF (Global-Earliest Deadline First) scheduling policy as it is lightweight and it guarantees bounded tardiness. Much effort has been spent in literature to provide efficiently computable ...
Dimensions of fixed-priority aperiodic servers
We identify the budget and the utilization of an aperiodic server as vital attributes that affect its performance. Based on this observation, we formulate an optimization problem in which we are given a minimum budget for multiple servers running at ...
Improved Uniprocessor Scheduling of Systems of Sporadic Constrained-Deadline Elastic Tasks
The elastic task model was proposed to allow for the accurate modeling of recurrent real-time workloads that are somewhat flexible with regards to the frequency at which they must be invoked. This is achieved by specifying a range of values for each ...
Enabling multi-link data transmission for collaborative sensing in open road scenarios
Fully autonomous driving applications rely on a complete knowledge of their operational environment to ensure safety while maintaining efficient driving. However, in scenarios with close visual restrictions, such as urban traffic, the lack of sensor ...
IPDeN 2.0: Real-time NoC with selective flit deflection and buffering
Network-on-Chips (NoCs) have proven to be a good alternative to traditional bus-based communication architectures to interconnect all programming elements (PEs) in modern Multiprocessor Systems- on-Chips (MPSoC). Wormhole switching with Virtual-Channels ...
Adding Empirical Real-Time Guarantees to LoRaWAN
LoRaWAN is a wide area network solution for large-area sensor networks; long range (LoRa) transmissions can be achieved, with low power transmissions, but only for very low bandwidth. One of the main challenges is the lack of guarantees in LoRaWAN, ...
On the Validity of Credit-Based Shaper Delay Guarantees in Decentralized Reservation Protocols
Resource reservation is a fundamental mechanism for ensuring quality of service in time-sensitive networks, which can be decentralized by using reservation protocols. In the Ethernet technology Time-Sensitive Networking, this has been proposed in ...
An Evaluation of Time-triggered Scheduling in the Linux Kernel
The GNU/Linux operating system (OS) is becoming more commonly used in real-time systems and has been modified with specific updates to provide faster and bounded response times as well as with fixed- and dynamic-priority real-time scheduling ...
A Procrastinating Control-Flow Integrity Framework for Periodic Real-Time Systems
Connected embedded systems and cyber-physical systems exhibit larger attack surface than isolated ones. Control-flow integrity (CFI) is a set of techniques to prevent attackers from redirecting program control-flow and performing arbitrary computation, ...
Scheduling Classifiers for Real-Time Hazard Perception Considering Functional Uncertainty
This paper addresses the problem of real-time classification-based machine perception, exemplified by a mobile autonomous system that must continually check that a designated area ahead is free of hazards. Such hazards must be identified within a ...
Multi-Model Specifications and their Application to Classification Systems
Many safety-critical systems are required to have their correctness validated prior to deployment. Such validation is typically performed using models of the run-time behaviour that the system is expected to exhibit and experience during run-time. ...
Task and Memory Mapping of Large Size Embedded Applications over NUMA architecture✱
- Alessandro Druetto,
- Enrico Bini,
- Andrea Grosso,
- Stefano Puri,
- Silvio Bacci,
- Marco Di Natale,
- Francesco Paladino
Multicore architectures provide the increased performance required by modern embedded real-time systems. Most platforms exhibit a non-uniform memory access (NUMA). In NUMA, memory banks with different access time can be explicitly addressed. Such an ...
Cache-Aware Allocation of Parallel Jobs on Multi-cores based on Learned Recency
Scheduling of tasks on multi- and many-cores benefits significantly from the efficient use of caches. Most previous approaches use the static analysis of software in the context of the processing hardware to derive fixed allocations of software to the ...
Reducing Loss of Service for Mixed-Criticality Systems through Cache- and Stress-Aware Scheduling
Hardware resources found in modern processor architecture, such as the memory hierarchy, can improve the performance of a task by anticipating its needs based on its execution history and behaviour. Interleaved jobs, belonging to other tasks with ...
Minimizing Cache Usage for Real-time Systems
Cache partitioning is a technique to reduce interference among tasks accessing the shared caches. To make this technique effective, cache segments must be given to the tasks that can benefit most from having their data and instructions cached for ...
Reducing Overall Path Latency in Automotive Logical Execution Time Scheduling via Reinforcement Learning
The Logical Execution Time paradigm is a promising approach for achieving time-deterministic communication on multi-core CPUs. Task scheduling under this paradigm is a variant of the Multi-Row Facility Layout Problem, which is known to be NP-hard. In ...
Timing Analysis of Cause-Effect Chains with Heterogeneous Communication Mechanisms
Software applications in automotive systems are comprised of communicating real-time tasks, described by cause-effect chains. To guarantee functional correctness, it is mandatory to verify end-to-end timing latencies of the cause-effect chains. The ...