Multi-/many-core systems are envisioned to satisfy the ever-increasing performance
requirements of complex applications in various domains such as embedded and high …

This paper considers the scheduling of parallel real-time tasks with implicit deadlines. Each
parallel task is characterized as a general directed acyclic graph (DAG). We analyze three …

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

Real-time systems increasingly contain processing units with multiple cores. To use this
additional computational power in hard deadline environments, one needs schedulability …

Bonifaci et al have recently introduced some novel analytical techniques in order to derive a
speed-up bound for the multiprocessor global EDF scheduling of systems of recurrent tasks …

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 …

Multicore systems are increasingly utilized in real-time systems in order to address the high
computational demands. To fully exploit the advantages of multicore processing, possible …

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 …

Consider the problem of scheduling a set of constrained-deadline sporadic real-time tasks
on a multiprocessor where (i) all processors are identical,(ii) each task is characterized by its …

This paper presents the first suspension-based real-time locking protocols for clustered
schedulers. Such schedulers pose challenges from a locking perspective because they …