In this 25th year anniversary paper for the IEEE Real Time Systems Symposium, we review
the key results in real-time scheduling theory and the historical events that led to the …

Embedded systems are informally defined as a collection of programmable parts
surrounded by ASICs and other standard components, that interact continuously with an …

From its roots in job-shop scheduling, research into fixed priority pre-emptive scheduling
theory has progressed from the artificial constraints and simplistic assumptions used in early …

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 …

Scheduling theories for xed-priority scheduling are now su ciently mature that a genuine
engineering approach to the construction of hard real-time systems is possible. In this …

The recurring real-time task model for hard-real-time task is studied from a feasibility-
analysis perspective. This model generalizes earlier models such as the sporadic task …

In a distributed hard real-time system, communications between tasks on different
processors must occur in bounded time. The inevitable communication delay is composed of …

The topic of the thesis is codesign of flexible real-time control systems. Integrating control
theory and real-time scheduling theory, it is possible to achieve higher resource utilization …

Cache memories are commonly avoided in real time systems because of their unpredictable
behavior. Recently, some research has been done to obtain tighter bounds on the worst …

In this paper we are interested in safety-critical distributed systems, composed of
heterogeneous processing elements interconnected using the TTEthernet protocol. We …