This survey covers hard real-time scheduling algorithms and schedulability analysis
techniques for homogeneous multiprocessor systems. It reviews the key results in this field …

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 …

The selection of task attributes for empirical evaluations of multiprocessor scheduling
algorithms and associated schedulability analyses can greatly affect the results of …

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 …

With the widespread adoption of multicore architectures, multiprocessors are now a
standard deployment platform for (soft) real-time applications. This dissertation addresses …

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 …

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 …

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 …

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 …

Global scheduling reduces the average response times as it can use the available
computing cores more efficiently for scheduling ready tasks. However, this flexibility poses …