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

In general computing systems, a job (process/task) may suspend itself whilst it is waiting for
some activity to complete, eg, an accelerator to return data. In real-time systems, such self …

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

When locking protocols are used in real-time systems, bounds on blocking times are
required when ensuring timing constraints. While the term “blocking” is well-understood in …

Motivated by the widespread use of spin locks in embedded multiprocessor real-time
systems, the worst-case blocking in spin locks is analyzed using mixed-integer linear …

In the domain of multiprocessor real-time systems, there has been a wealth of recent work
on scheduling, but relatively little work on the equally-important topic of synchronization …

Lock-based resource sharing protocols for single processor systems are well understood
and supported in programming languages and in Real-Time Operating Systems. In contrast …

In this paper we consider global fixed-priority preemptive multiprocessor scheduling of
constrained-deadline sporadic tasks that share resources in a non-nested manner. We …

Graphics processing units, GPUs, are powerful processors that can offer significant
performance advantages over traditional CPUs. The last decade has seen rapid …

We consider the issue of deadline tardiness under global multiprocessor scheduling
algorithms. We present a general tardiness-bound derivation that is applicable to a wide …