In this paper we implement the EDF-VD (Earliest Deadline First with Virtual Deadline) algorithm described in [1] for scheduling mixed-criticality, realtime task systems on preemptive uniprocessor platforms. We compare the scheduling overheads of this algorithm with the scheduling overheads of the well known EDF (Earliest Deadline First) algorithm for scheduling realtime task systems on preempti...

Let F be a eld of characteristic p > 0 and G be a smooth nite algebraic group over F . We compute the essential dimension edF (G; p) of G at p. That is, we show that edF (G; p) = { 1, if p divides |G|, and 0, otherwise.

In the present paper, some well-known tests based on empirical distribution functions (EDF) with estimated parameters for testing composite normality hypothesis are revisited, and new results asymptotic properties provided. particular, approximate Bahadur slopes obtained in case of close alternatives EDF-based as well likelihood ratio test. The local efficiencies calculated several alternatives...

Jeremy P. Erickson: Managing Tardiness Bounds and Overload in Soft Real-Time Systems (Under the direction of James H. Anderson) In some systems, such as future generations of unmanned aerial vehicles (UAVs), different software running on the same machine will require different timing guarantees. For example, flight control software has hard real-time (HRT) requirements—if a job (i.e., invocatio...

Consider the problem of scheduling sporadically-arriving tasks with implicit deadlines using Earliest-Deadline-First (EDF) on a single processor. The system may undergo changes in its operational modes and therefore the characteristics of the task set may change at run-time. We consider a well-established previously published mode-change protocol by Sha et al. and we show that if every mode uti...

für meinen Vater ii Summary Within this thesis time evaluated predicate/transition nets (t-pr/t-nets) have been developed for the purpose to model, simulate and verify complex real-time systems. Therefore, t-pr/t-nets integrate concepts to model timing constraints and can be analysed by the means of structural analysis such as the calculation of sand t-invariants as well as the identification o...

Scheduling real-time systems on multiprocessors introduces complexities that do not arise when using uniprocessors. When scheduling using EDF on multiprocessor platforms, breaking deadline ties in different ways can change the resulting schedule dramatically. We consider methods to resolve the ambiguities in EDF priorities due to coincident deadlines. We show that no optimal ambiguity solver ca...

This paper examines the role of external debt financing (EDF) in shaping credit cycles and joint implications EDF flows growth for output volatility ten major emerging economies. We find that extreme phases—known as surge stop episodes—in are significantly associated with surges episodes shown by a panel multinominal logit estimation. However, association is asymmetric—EDF more likely to bring ...