ISSN: 2165- 7866
Real-time embedded systems have to provide the highest Quality of Service despite possible processing overloads. In such systems, programs are characterized by upper bounds on finishing times and the QoS is assessed by the ratio of successful deadlines. In this article, we deal with this issue. We focus on single processor architectures in the framework of firm real-time applications that accept deadline missing under some specified limits. Tasks are assumed to be periodic. We present a novel model for tasks which is called BGW model. It is drawn from two approaches respectively known as the skip-over model and the Deadline Mechanism. We propose specific dynamic priority schedulers based on EDF (Earliest Deadline First) for BGW task sets and we briefly report the results of a simulation study.