The earliest deadline first scheduling for real-time traffic in the Internet

The Ant Colony Optimization (ACO) algorithms are computational models inspired by the collective foraging behavior of ants. The ACO algorithms provide inherent parallelism, which is very useful in multiprocessor environments. They provide balance between exploration and exploitation along with robustness and simplicity of individual agent. In this paper, ACO based dynamic scheduling algorithm for homogeneous multiprocessor real-time systems is proposed. The results obtained during simulation are measured in terms of Success Ratio (SR) and Effective CPU Utilization (ECU) and compared with the results of Earliest Deadline First (EDF) algorithm in the same environment. It has been observed that the proposed algorithm is very efficient in underloaded conditions and it performs very well during overloaded conditions also. Moreover, the proposed algorithm can schedule some typical instances successfully which are not possible to schedule using EDF algorithm.

Download Full-text

A Real-Time Message Scheduling Scheme Based on Optimal Earliest Deadline First Policy for Dual Channel Wireless Networks

Embedded and Ubiquitous Computing - Lecture Notes in Computer Science ◽

10.1007/11802167_28 ◽

2006 ◽

pp. 264-273 ◽

Cited By ~ 3

Author(s):

Junghoon Lee ◽

Mikyung Kang ◽

Gyung-Leen Park ◽

Ikchan Kim ◽

Cheolmin Kim ◽

...

Keyword(s):

Wireless Networks ◽

Real Time ◽

Earliest Deadline First ◽

Scheduling Scheme ◽

Dual Channel ◽

Message Scheduling ◽

Earliest Deadline

Download Full-text

Thermal Analysis of Fair Scheduling in Real-time Embedded Systems

International Journal of Reconfigurable and Embedded Systems (IJRES) ◽

10.11591/ijres.v7.i1.pp48-56 ◽

2018 ◽

Vol 7 (1) ◽

pp. 48

Author(s):

Tayyaba Bokhari ◽

Sajjad Haider Shami ◽

Farhan Haseeb

Keyword(s):

Real Time ◽

Thermal Management ◽

System Reliability ◽

Operating Temperature ◽

Multiprocessor Scheduling ◽

Earliest Deadline First ◽

Fair Scheduling ◽

The Past ◽

Reliability Performance ◽

Earliest Deadline

Over the past few decades, increased demand of highly sophisticated real-time applications with complex functionalities has directly led to exponentially increased power consumption and significantly elevated system temperatures. These elevated temperature and thermal variations present formidable challenges towards system reliability, performance, cooling cost and leakages. This article explores the thermal management strength of two fairness based algorithms, namely Proportional Fair (PFair) and Deadline Partitioning Fair (DP-Fair). In related literature, the introduction of fairness is often considered as a tool to achieve optimality in multiprocessor scheduling algorithms. This work shows that these algorithms bring about better thermal profile when compared with the commonly used Earliest Deadline First (EDF) algorithm in similar conditions both in uniprocessor and multiprocessor environments. A simulation is conducted for periodic task set model. The obtained results are encouraging and show that use of fairness based algorithms reduces the operating temperature, peak temperature, and thermal variations.

Download Full-text

An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System

International Journal of Advanced Computer Science and Applications ◽

10.14569/ijacsa.2011.020207 ◽

2011 ◽

Vol 2 (2) ◽

Cited By ~ 6

Author(s):

Jagbeer Singh ◽

Bichitrananda Patra ◽

Satyendra Prasad

Keyword(s):

Real Time ◽

Time Complexity ◽

Scheduling Algorithm ◽

Earliest Deadline First ◽

Time System ◽

Real Time System ◽

Earliest Deadline

Download Full-text

Energy harvesting earliest deadline first scheduling algorithm for increasing lifetime of real time systems

Restaurant Business ◽

10.26643/rb.v118i4.9757 ◽

2019 ◽

Vol 118 (4) ◽

pp. 160

Author(s):

G. Madhumita ◽

G. Rajini ◽

B. Subisha

Keyword(s):

Energy Consumption ◽

Energy Harvesting ◽

Real Time ◽

Scheduling Algorithm ◽

Earliest Deadline First ◽

Real Time Systems ◽

Tasks Scheduling ◽

Time Systems ◽

Earliest Deadline ◽

Reducing Energy

In this paper, a new approach for energy minimization in energy harvesting real time systems has been investigated. Lifetime of a real time systems is depend upon its battery life. Energy is a parameter by which the lifetime of system can be enhanced. To work continuously and successively, energy harvesting is used as a regular source of energy. EDF (Earliest Deadline First) is a traditional real time tasks scheduling algorithm and DVS (Dynamic Voltage Scaling) is used for reducing energy consumption. In this paper, we propose an Energy Harvesting Earliest Deadline First (EH-EDF) scheduling algorithm for increasing lifetime of real time systems using DVS for reducing energy consumption and EDF for tasks scheduling with energy harvesting as regular energy supply. Our experimental results show that the proposed approach perform better to reduce energy consumption and increases the system lifetime as compared with existing approaches.

Download Full-text