This paper reports on our on going empirical evalu ation of a two tiered resource allocation scheme assum ing independent jobs that is jobs have no precedence constraints The rst tier extends the temporal density approach load balancing within a time interval while the second tier uses variations of the Earliest Deadline First EDF approach to schedule jobs at a site However job scheduling at si...

The Quality of Service (QoS) of real time applications is affected in a rather direct manner by the timely delivery of Application-level Data Units (ADUs) which are typically mapped into several Network-level Data Units (NDUs). As a consequence, it would be reasonable to associate a common deadline with all the NDUs in one ADU and develop a scheduling policy that aims to maximise the number of ...

We present new admission tests for periodic real-time threads with explicitly stated deadlines scheduled according to the earliest deadline first (EDF) algorithm. In traditional real-time periodic scheduling, the deadline of a periodic thread is conventionally the end of the current period. In contrast, our tests support periodic threads in which the deadline may be earlier than the end of the ...

Many sensor-based control systems are dynamically changing, and thus require a flexible scheduler. The rate monotonic (RM) real-time scheduling algorithm does not support such dynamic systems very well. On the other hand, with earliest-deadline-first (EDF) and minimum-laxity-first (MLF) dynamic scheduling algorithms, a transient overload in the system may cause a critical task to fail, which is...

 This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in an Earliest Deadline First (EDF) scheduler. The statistical QoS targets for each service class are expressed in terms of a delay threshold and delay violation probability. We study both cases isolated nodes and end-to-end paths comprisin...

This paper presents a sensitivity analysis for the dimensioning of real-time systems in which sporadic tasks are executed according to the preemptive Earliest Deadline First (EDF) scheduling policy. The timeliness constraints of the tasks are expressed in terms of late termination deadlines. A general case is considered, where the task deadlines are independent of the task sporadicity intervals...

The earliest-deadline-first (EDF) scheduling algorithm, while not optimal for globally-scheduled hard real-time systems, can support any feasible task system with bounded lateness. Furthermore, global-EDF-like (GEL) scheduling algorithms, which prioritize jobs by assigning them fixed priority points based on per-task relative priority points, have been shown to share this same property. Some su...

The Quality of Service (QoS) of real time applications is aaected in a rather direct manner by the timely delivery of Application-level Data Units (ADUs) which are typically mapped into several Network-level Data Units (NDUs). As a consequence, it would be reasonable to associate a common deadline with all the NDUs in one ADU and develop a scheduling policy that aims to maximise the number of A...

This paper develops a framework for statistically guaranteeing end-to-end delay bounds to envelopeconstrained connections transporting real-time traffic in a network of switches employing the Earliest Deadline First (EDF) packet scheduling scheme in conjunction with per-hop traffic shaping. The performance of an isolated EDF scheduler fed by markovian sources has been studied earlier in the lit...