Niklas Ueter
YOU?
Author Swipe
View article: Probabilistic Reaction Time Analysis
Probabilistic Reaction Time Analysis Open
In many embedded systems, for instance, in the automotive, avionic, or robotics domain, critical functionalities are implemented via chains of communicating recurrent tasks. To ensure safety and correctness of such systems, guarantees on t…
View article: Parallel Path Progression DAG Scheduling
Parallel Path Progression DAG Scheduling Open
Increasing performance needs of modern cyber-physical systems leads to multiprocessor architectures being increasingly utilized. To efficiently exploit their potential parallelism in hard real-time systems, appropriate task models and sche…
View article: Timing Analysis of Cause-Effect Chains with Heterogeneous Communication Mechanisms
Timing Analysis of Cause-Effect Chains with Heterogeneous Communication Mechanisms Open
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 ch…
View article: Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains
Compositional Timing Analysis of Asynchronized Distributed Cause-effect Chains Open
Real-time systems require the formal guarantee of timing constraints, not only for the individual tasks but also for the end-to-end latency of data flows. The data flow among multiple tasks, e.g., from sensors to actuators, is described by…
View article: Type-Aware Federated Scheduling for Typed DAG Tasks on Heterogeneous Multicore Platforms
Type-Aware Federated Scheduling for Typed DAG Tasks on Heterogeneous Multicore Platforms Open
To utilize the performance benefits of heterogeneous multicore platforms in real-time systems, we need task models that expose the parallelism and heterogeneity of the workload, such as typed DAG tasks, as well as scheduling algorithms tha…
View article: Parallel Path Progression DAG Scheduling
Parallel Path Progression DAG Scheduling Open
To satisfy the increasing performance needs of modern cyber-physical systems, multiprocessor architectures are increasingly utilized. To efficiently exploit their potential parallelism in hard real-time systems, appropriate task models and…
View article: Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks
Response-Time Analysis and Optimization for Probabilistic Conditional Parallel DAG Tasks Open
Real-time systems increasingly use multicore processors in order to satisfy thermal, power, and computational requirements. To exploit the architectural parallelism offered by the multicore processors, parallel task models, scheduling algo…
View article: Hard Real-Time Stationary GANG-Scheduling
Hard Real-Time Stationary GANG-Scheduling Open
The scheduling of parallel real-time tasks enables the efficient utilization of modern multiprocessor platforms for systems with real-time constrains. In this situation, the gang task model, in which each parallel sub-job has to be execute…
View article: Scheduling of Real-Time Tasks With Multiple Critical Sections in Multiprocessor Systems
Scheduling of Real-Time Tasks With Multiple Critical Sections in Multiprocessor Systems Open
The performance of multiprocessor synchronization and locking protocols is a key factor to utilize the computation power of multiprocessor systems under real-time constraints.While multiple protocols have been developed in the past decades…
View article: Simultaneous Progressing Switching Protocols for Timing Predictable Real-Time Network-on-Chips
Simultaneous Progressing Switching Protocols for Timing Predictable Real-Time Network-on-Chips Open
Many-core systems require inter-core communication, and network-on-chips (NoCs) have been demonstrated to provide good scalability. However, not only the distributed structure but also the link switching on the NoCs have imposed a great ch…
View article: On the Formalism and Properties of Timing Analyses in Real-Time Embedded Systems
On the Formalism and Properties of Timing Analyses in Real-Time Embedded Systems Open
Real-time embedded systems are information processing systems that require both functional and timing correctness. Such systems usually interact with the physical world, where time naturally processes. Therefore, safe bounds of determinist…
View article: Scheduling of Real-Time Tasks with Multiple Critical Sections in Multiprocessor Systems
Scheduling of Real-Time Tasks with Multiple Critical Sections in Multiprocessor Systems Open
The performance of multiprocessor synchronization and locking protocols is a key factor to utilize the computation power of multiprocessor systems under real-time constraints. While multiple protocols have been developed in the past decade…
View article: Simultaneous Progressing Switching Protocols for Timing Predictable\n Real-Time Network-on-Chips
Simultaneous Progressing Switching Protocols for Timing Predictable\n Real-Time Network-on-Chips Open
Many-core systems require inter-core communication, and network-on-chips\n(NoCs) have been demonstrated to provide good scalability. However, not only\nthe distributed structure but also the link switching on the NoCs have imposed\na great…
View article: Reservation-Based Federated Scheduling for Parallel Real-Time Tasks
Reservation-Based Federated Scheduling for Parallel Real-Time Tasks Open
This paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based schedul…
View article: Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems Open
The sporadic task model is often used to analyze recurrent execution of identical tasks in real-time systems. A sporadic task defines an infinite sequence of task instances, also called jobs, that arrive under the minimum inter-arrival tim…
View article: Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems
Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems Open
The sporadic task model is often used to analyze recurrent execution of tasks in real-time systems. A sporadic task defines an infinite sequence of task instances, also called jobs, that arrive under the minimum inter-arrival time constrai…
View article: Evaluations of Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems (Artifact)
Evaluations of Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems (Artifact) Open
This artifact provides the experimental details and implementations of all the facilitated schedulability tests used in the reported acceptance ratio based evaluations as documented in the related paper "Push Forward: Global Fixed-Priority…
View article: Parametric utilization bounds for implicit-deadline periodic tasks in automotive systems
Parametric utilization bounds for implicit-deadline periodic tasks in automotive systems Open
Fixed-priority scheduling has been widely used in safety-critical applications. This paper explores the parametric utilization bounds for implicit-deadline periodic tasks in automotive uniprocessor systems, where the period of a task is ei…