This paper presents work on a switched Ethernet network extended to allow for earliest deadline first (EDF) scheduling. We show by example that asymmetric deadline partitioning between the links of a real-time channel can increase the utilization substantially, still not violating the real-time guarantees. We also report measurements on a software implementation of the switch on an ordinary PC.

We study the problem of QoS guarantee for di erentiated services. A two-level hierarchical scheduling framework is deployed for the separation of the QoS metrics. Due to the desirable property of minimizing the maximum packet lateness, the Earliest Deadline First (EDF) scheduling is adopted to provide the in-class scheduling for the time-sensitive traÆc. We propose to employ an EDF scheduler co...

Several methods have been developed for determining fixed priority configurations on uniprocessor. In this paper, we present a new method, called PFX, for determining fixed priority configurations on multiprocessor. PFX follows an offline approach: our constructive process uses an inductive analysis of the whole set of possibilities. Therefore, PFX provides all valid fixed priority configuratio...

WiMAX, Worldwide Interoperability for Microwave Access, is a developing wireless communication scheme that can provide broadband access to large-scale coverage. WiMAX belongs to the family of standards of IEEE-802.16. To satisfy user demands and support a new set of real time services and applications, a realistic and dynamic resource allocation algorithm is mandatory. One of the most efficient...

Fixed-task-priority (FTP) scheduling and earliest-deadline-first (EDF) scheduling policies are alike in fixing the priority of each job of a task at the time the job is released. This common feature of FTP and EDF scheduling permits a unified analysis of scheduling failures, to derive new sufficient tests for meeting all deadlines of a set of independent sporadic tasks under a global preemptive...

Multiprocessor scheduling in real time systems follows global queue and partitioned queue methods. Partitioned queue scheduling technique organised with dedicated queues and tasks are scheduled to corresponding processor, based on Earliest Deadline First (EDF) algorithm. EDF is an optimal technique to schedule aperiodic, periodic and sporadic tasks in Real Time Systems (RTS). Deadline of the ta...

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 is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an attractive choice for scheduling soft-real-time systems on multiprocessors. Previous work has demonstrated that the maximum tardiness is bounded, and has derived formulas for computing tardiness bounds, in EDF-schedule...

Deadlines are the most important events in real-time systems. Realtime programs must therefore be aware of deadlines, and be able to identify and react to missed deadlines. Moreover, Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In this paper we explore how a resource sharing protocol (called the DFP – Deadline ...

While Grid users are often interested in satisfaction of their Quality of Service (QoS) requirements, these cannot be satisfactory handled by commonly used queuebased approaches. This paper concentrates on the application of schedule-based methods which allow both efficient handling of QoS requirements as well as traditional machine usage objective. An incremental application of our methods rea...