scholarly journals Fibre-ribbon ring network with inherent support for earliest deadline first message scheduling

Author(s):  
C. Bergenhem ◽  
M. Jonsson
2014 ◽  
Author(s):  
Abhilash Thekkilakattil ◽  
Sanjoy Baruah ◽  
Radu Dobrin ◽  
Sasikumar Punnekkat

2008 ◽  
Vol 40 (2) ◽  
pp. 208-237 ◽  
Author(s):  
Ming Xiong ◽  
Qiong Wang ◽  
Krithi Ramamritham

Author(s):  
Apurva Shah ◽  
Ketan Kotecha

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.


2018 ◽  
Vol 7 (3) ◽  
pp. 1956
Author(s):  
A Felix Arokya Jose ◽  
C Anand Deva Durai ◽  
S John Livingston

Wireless Sensor Network (WSN) has an enormous scope of utilizations in detecting different parameters such as temperature, pressure, sound, pollution, etc. The sensed data in each sensor node are a valuable one. To communicate the information to the base station for further processing, a lot of strategies are available. Each sensor senses the data in different sampling rate depending upon the sudden raise in the sensing parameters. Data communication to the base station is very critical due to the dynamicity of the environment during the stipulated time.The sensed data should reach the base station before the data becomes invalid due to the violation of the deadline. In order to avoid deadline violation so that the sensed data becomes useless, this paper proposing a novel data collection algorithm based on the popular Earliest Deadline First (EDF) scheduling algorithm. The various simulation parameters are taken into account to verify the performance of the proposed method and the result shows that it achieves high throughput, low delay, high Packet Delivery Ratio (PDR) and low energy consumption.  


Sign in / Sign up

Export Citation Format

Share Document