Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, su...
While early research on real-time computing was concerned with guaranteeing avoidance of undesirable effects such as overload and deadline misses, adaptive real-time systems are d...
Chenyang Lu, John A. Stankovic, Tarek F. Abdelzahe...
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...
This paper describes how Dynamic WindowConstrained Scheduling (DWCS) can guarantee real-time service to packets from multiple streams with different performance objectives. We sho...
A framework for scheduling a number of di erent real-time applications on a single shared preemptable processor is proposed. This framework enforces complete isolation among the d...
In this paper, we study the problem of scheduling task sets with (m,k) constraints. In our approach, jobs of each task are partitioned into two sets: mandatory and optional. Manda...
In this paper we propose a novel scheduling framework for a real-timeenvironmentthat experiences dynamic changes. Thisframework is capable of adjusting the system workload in incr...