A survey of hard real-time scheduling for multiprocessor systems
This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …
A review of priority assignment in real-time systems
It is over 40 years since the first seminal work on priority assignment for real-time systems
using fixed priority scheduling. Since then, huge progress has been made in the field of real …
using fixed priority scheduling. Since then, huge progress has been made in the field of real …
[PDF][PDF] Techniques for the synthesis of multiprocessor tasksets
P Emberson, R Stafford, RI Davis - proceedings 1st International …, 2010 - retis.sssup.it
The selection of task attributes for empirical evaluations of multiprocessor scheduling
algorithms and associated schedulability analyses can greatly affect the results of …
algorithms and associated schedulability analyses can greatly affect the results of …
Scheduling and locking in multiprocessor real-time operating systems
BB Brandenburg - 2011 - search.proquest.com
With the widespread adoption of multicore architectures, multiprocessors are now a
standard deployment platform for (soft) real-time applications. This dissertation addresses …
standard deployment platform for (soft) real-time applications. This dissertation addresses …
Clustering with multiple graphs
W Tang, Z Lu, IS Dhillon - 2009 Ninth IEEE International …, 2009 - ieeexplore.ieee.org
In graph-based learning models, entities are often represented as vertices in an undirected
graph with weighted edges describing the relationships between entities. In many real-world …
graph with weighted edges describing the relationships between entities. In many real-world …
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE
Real-Time Systems Symposium 2009. This paper has been updated with respect to …
Real-Time Systems Symposium 2009. This paper has been updated with respect to …
Parallel scheduling for cyber-physical systems: Analysis and case study on a self-driving car
As the complexity of software for Cyber-Physical Systems (CPS) rapidly increases, multi-
core processors and parallel programming models such as OpenMP become appealing to …
core processors and parallel programming models such as OpenMP become appealing to …
Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper addresses the problem of priority assignment in multiprocessor real-time systems
using global fixed task-priority pre-emptive scheduling. In this paper, we prove that Audsley's …
using global fixed task-priority pre-emptive scheduling. In this paper, we prove that Audsley's …
Outstanding paper award: Analysis of global edf for parallel tasks
As multicore processors become ever more prevalent, it is important for real-time programs
to take advantage of intra-task parallelism in order to support computation-intensive …
to take advantage of intra-task parallelism in order to support computation-intensive …
New response time bounds for fixed priority multiprocessor scheduling
Recently, there have been several promising techniques developed for schedulability
analysis and response time analysis for multiprocessor systems based on over …
analysis and response time analysis for multiprocessor systems based on over …