The Real-Time Systems Group studies application systems in which timing constraints exist. Usually, such systems are structured as a set of tasks (i.e., programs) and timing constraints are defined in terms of per-task deadline requirements. To ensure that timing constraints are met, offline validation algorithms are required that check whether deadlines will be met at runtime. The design of such validation algorithms hinges on how tasks are scheduled and how various complexities such as synchronization are addressed. Accordingly, research involving the design of algorithms for validating, scheduling, and synchronizing real-time task systems has been a continual focus within the group. Additionally, the development and evaluation of operating system infrastructure, in the form of scheduling and synchronization methods, has been an active topic of investigation. Many of the group’s current efforts focus on resource allocation problems that arise when implementing real-time applications on multicore machines.