Most of the hard-real-time scheduling theory for multiprocessor systems assumes independent periodic or sporadic tasks. Such a simple task model is not directly applicable to mode...
Computer systems researchers have begun to apply the Foreground-Background (FB) scheduling discipline to a variety of applications, and as a result, there has been a resurgence in...
This paper presents a new workload model, called the state-dependent deadline model, for applications whose high-level timing requirements may change with time. The problem is how...