In this paper a new non-preemptive domain clustering scheduling algorithm for soft real time application is proposed. The main aim of this algorithm is to achieve high deadline meeting ratio of the group Earliest Deadline First (gEDF) algorithm by maintaining the excellent performance during normal load. An efficient non-preemptive algorithm called Domain Cluster – group EDF (DC-gEDF) is propos...

Scheduling is an important factor for the performance of Wimax system, especially for real-time applications. Earliest Deadline First (EDF) is a delay-optimal scheduling discipline commonly used in real-time applications in wired and wireless networks. Traditional schedulers like EDF do not take the packet destination distance into account. In this paper, we present a scheme that differentiates...

The assignment of scheduling parameters under the Earliest Deadline First (EDF) scheduling policy is trivial in single processor systems because deadlines are used directly. However, it is still difficult to find a feasible deadline assignment for EDF distributed systems when the utilization levels of the CPUs and communication networks are pushed near to their limits. Most distributed applicat...

(m, k)-firm real-time or weakly hard real-time (WHRT) guarantee is becoming attractive as it closes the gap between hard and soft (or probabilistic) real-time guarantee, and enables finer granularity of real-time QoS through adjusting m and k. For multiple streams with (m, k)-firm constraint sharing a single server, an on-line priority assignment policy based on the most recent k-length history...

In a number of application domains, the volatility of the monitored environment where Wireless Sensor Networks (WSNs) operate engenders timing constraints on the generation, processing, and communication of sensory data. In this paper, we primarily focus on the use of an information theoretic approach, namely network coding, to improve the on-time delivery of messages in IEEE 802.15.4-compliant...

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...

A scheduling algorithm is the one which decides a schedule for a given set of tasks. There are a number of algorithms for task scheduling on a processor. Some of these algorithms are used for scheduling tasks on a multiprocessor system either under the partitioning scheme or under the global scheme. The optimal algorithm is the Earliest Deadline First (EDF) algorithm. If a set of task cannot be...

Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...

.............................................................................................................................................................. 2