There are two major performance issues in a real-time system where a processor has a set
of devices connected to it at different priority levels. The first is to prove whether, for a given …

The preemptive scheduling of systems of periodic tasks on a platform comprised of several
identical processors is considered. A scheduling algorithm is proposed for static-priority …

Algorithms for allocating CPU bandwidth to soft real-time processes exist, yet best-effort
scheduling remains an attractive model for both application developers and users. Best …

Many of the trends that have dominated recent evolution and advancement within the
computer architecture community have complicated the analysis of task execution times …

The purpose of this paper is to define a series of requirements and associated experiments
called the Hartstone Uniprocessor Benchmark (HUB), to be used in testing the ability of a …

More and more programmers find their software being used in performance critical
applications. Unfortunately, they have limited techniques at their disposal to help guarantee …

The design, implementation, and experimental evaluation of a multiprocessor scheduler
used with robotics applications and other real-time programs are described. The scheduler's …