High-Performance and Time-Predictable Embedded Computing

  title={High-Performance and Time-Predictable Embedded Computing},
  author={Lu{\'i}s Miguel Pinho and Eduardo Qui{\~n}ones and Marko Bertogna and Andrea Marongiu and Vincent N{\'e}lis and Paolo Gai and Juan Sancho},
Luís M iuel Pho, Edardo Q uines, M arko B ergna, A nrea M arngiu, V inent N élis, Polo G ai nd Jan Sncho (Eitors) Nowadays, the prevalence of computing systems in our lives is so ubiquitous that we live in a cyber-physical world dominated by computer systems, from pacemakers to cars and airplanes. These systems demand for more computational performance to process large amounts of data from multiple data sources with guaranteed processing times. Actuating outside of the required timing bounds… 
2 Citations
Deterministic OpenMP and the LBP Parallelizing Manycore Processor
Experimental results indicate that LBP performance does not suffer from the elimination of all the high performance features incompatible with an embedded processor (predictors, caches), and the proposed Deterministic OpenMP runtime favoring local memory accesses.
Preliminary study on the automatic parallelism optimization model for image enhancement algorithms based on Intel's® Xeon Phi
This research proposes different optimization approaches for Par4All based on Intel®'s Xeon Phi high‐performance computing platform that are based on the structural features of the image‐enhancement algorithms, which can further optimize the original parallel algorithm.


Predictable synchronization mechanisms for multiprocessor real-time systems
Three, more efficient, strong semaphore solutions are proposed in this paper, based on the main theorem of the paper, the Deferred Bus theorem, and one of them is an extension to the existing Burns' algorithm.
An optimal boundary fair scheduling
An optimal boundary-fair scheduling algorithm for sporadic tasks is proposed, which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines, and outperforms the state-of-the-art discrete-time optimal scheduler.
The Performance of Spin Lock Alternatives for Shared-Memory Multiprocessors
  • T. Anderson
  • Computer Science
    IEEE Trans. Parallel Distributed Syst.
  • 1990
The author examines the questions of whether there are efficient algorithms for software spin-waiting given hardware support for atomic instructions, or whether more complex kinds of hardware support
Complex events and actions to control cyber-physical systems
This paper proposes a novel rule-based approach combining deductive and reactive rules to specify and describe cyber-physical systems (CPS), and describes an approach to CPS actions which takes these important particularities into account.
Response-Time Analysis of Conditional DAG Tasks in Multiprocessor Systems
This work integrates control flow information in the task model, considering conditional parallel tasks (cp-tasks) represented by DAGs composed of both precedence and conditional edges, and significantly tightens the schedulability analysis of non-conditional tasks over existing approaches.
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
This work analytically establishes the optimality of LLREF, and establishes that the algorithm has bounded overhead, and this bound is independent of time quanta (unlike Pfair).
Scheduling multithreaded computations by work stealing
  • R. Blumofe
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
This paper studies the problem of efficiently scheduling fully strict (i.e., well-structured) multithreaded computations on parallel computers. A popular and practical method of scheduling this kind
A static scheduling approach to enable safety-critical OpenMP applications
This paper proposes two OpenMP-compliant static allocation approaches: an optimal but costly approach based on an ILP formulation, and a sub-optimal but tractable approach that computes a worst-case makespan bound close to the optimal one.
An Analysis of Lazy and Eager Limited Preemption Approaches under DAG-Based Global Fixed Priority Scheduling
A new response time analysis is proposed that computes an upper bound on the lower priority blocking that each task may incur with eager and lazy preemptions and demonstrates that, despite the eager approach generates a higher number of priority inversions, the blocking impact is generally smaller than in the lazy approach, leading to a better schedulability performance.
On the Design of an Optimal Multiprocessor Real-Time Scheduling Algorithm under Practical Considerations (Extended Version)
A schedulability analysis indicates a priori whether the real-time application can be scheduled by the improvement of BF without missing any deadline, and is the first such test for multiprocessors that takes into account all the main overheads generated by the Operating System.