The question whether preemptive algorithms are better than nonpreemptive ones for
scheduling a set of real-time tasks has been debated for a long time in the research …

This paper was written to accompany a talk at the ETR Summer School in Toulouse 2013. It
provides a background and primer to scheduling and schedulability analysis for hard real …

Without the use of caches the increasing gap between processor and memory speeds in
modern embedded microprocessors would have resulted in memory access times becoming …

The detection and tracking of people lie at the heart of many current and near-future
applications of computer vision. We describe a background subtraction system designed to …

Increasing the capacity of the Last Level Cache (LLC) can help scale the memory wall. Due
to prohibitive area and leakage power, however, growing conventional SRAM LLC already …

Real-time systems are reactive computer systems that must produce their reaction to a
stimulus within given time bounds. A vital verification requirement is to estimate the Worst …

Without the use of cache the increasing gap between processor and memory speeds in
modern embedded microprocessors would have resulted in memory access times becoming …

Limited preemptive (LP) scheduling has been demonstrated to effectively improve the
schedulability of fully preemptive (FP) and fully non-preemptive (FNP) paradigms. On one …

Cache memories have been introduced into embedded systems to prevent memory access
times from becoming an unacceptable performance bottleneck. Memory and cache are split …

The schedulability of systems using fixed priority pre-emptive scheduling can be improved
by the use of non-pre-emptive regions at the end of each task's execution, an approach …