Earliest deadline first (edf) is a widely used algorithm for online deadline scheduling. It has been known for long that edf is optimal for scheduling an underloaded, single-processor system; recent results on the extra-resource analysis of edf further revealed that edf when using moderately faster processors can achieve optimal performance in the underloaded, multi-processor setting. This pape...

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...

Future ATM networks will support real-time voice and video services and we need to guarantee cell transfer delay and cell loss probability to launch such services. The Earliest Deadline First (EDF) scheme is a suitable service scheduling scheme for these services since it has been proven that it can minimize the number of late cells by assigning deadlines to the cells. However, the EDF scheme c...

The most important requirement for real-time systems is the capability to support the timely execution of applications. Real-time scheduling over a single processor has been widely studied in the last thirty years, and it has been proven that the non-preemptive version of Earliest Deadline First (EDF) algorithm is optimal [1], in the sense that if a set of tasks is schedulable, it is also sched...

This paper compares the behaviour of Earliest Deadline First (EDF) and Opportunistic-EDF (O-EDF) with that of Round Robin, Proportional Fair Throughput (PFT), and Maximum Carrier to Interference ratio (MaxC/I) . Video, voice and web traffic are transmitted through an HSDPA air interface. The resultant queueing delay and fairness are measured and compared for each scheduler.

This paper proposes a novel schedule-based approach for scheduling a continuous stream of batch jobs on the machines of a computational Grid. Our new solutions represented by dispatching rule Earliest Gap— Earliest Deadline First (EG-EDF) and Tabu search are based on the idea of filling gaps in the existing schedule. EG-EDF rule is able to build the schedule for all jobs incrementally by applyi...

This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based on the well-known Global Earliest Deadline First (G-EDF) algorithm, as long as its laxity – the amount of time from the earliest possible time ...

Real time system is the system where data should be processed in time. The real time data is stored in real time database within the specified time interval. This time interval is called as validity time interval [1],[2]. The validity of real time data is maintained using different scheduling algorithms. The process of maintaining the validity of real time data is done by using several update t...

The core of virtualization is hypervisor which directly determines the platform performance. How to allocate resource effectively becomes an important problem. Xen is an open source hypervisor and used as a virtual machine monitor. In this paper, we designed an efficient virtual CPU scheduling algorithm that combined Deadline-Monotonic Scheduling with Simple Earliest Deadline First (EDF) schedu...

In this paper, we provide an efficient solution for periodic real-time tasks with (potentially) different power consumption characteristics. We show that, a task T, can run a t a constant speed 5';. at every instance without hurting optimality. We sketch an O(n2 log n) algorithm to compute the optimal S;. values. We also prove that the EDF (Earliest Deadline First) scheduling policy can be used...