A Low Power Scheduling Algorithm with Balanced Factor for Periodic Tasks

2017 ◽  
Author(s):  
Wu Haotian ◽  
Guo Ruifeng ◽  
Deng Changyi ◽  
Peng Azhen ◽  
Zheng Liaomo
Keyword(s):  
Low Power ◽  
Scheduling Algorithm ◽  
Periodic Tasks ◽  
Power Scheduling

A FAST SCHEDULING ALGORITHM FOR LOW POWER DESIGN

2005 ◽  
Vol 14 (04) ◽  
pp. 735-755
Author(s):  
ASHOK KUMAR ◽  
MAGDY BAYOUMI
Keyword(s):  
Low Power ◽  
Scheduling Algorithm ◽  
Low Power Design ◽  
Power Reduction ◽  
Data Flow Graph ◽  
Maximal Power ◽  
Linear Programming Method ◽  
Voltage Level ◽  
Power Scheduling ◽  
High Level

In this paper, a fast low power scheduling algorithm is presented for high-level synthesis with multiple voltages. The resources are assumed to operate at different voltages and their power consumption and delay for each voltage level is known in advance. The proposed methodology achieves maximal power reduction of functional units by identifying the maximal available parallelism of power hungry operators in an initial schedule. The proposed methodology is developed in the framework of a modified stochastic evolution mechanism in order to tame the computational complexity. The proposed scheduling technique is extremely fast and it runs in quadratic complexity in the number of the nodes in the data flow graph of the design. This is the fastest reported time of scheduling algorithms for resource-and-latency constrained scheduling with resources operating at multiple voltages. The algorithm produces results within accuracy of 3%–5% of the linear programming method.

Feedback Controlled Adaptive Bandwidth Server Scheduling and its Application in NCS

2014 ◽  
Vol 631-632 ◽  
pp. 761-765
Author(s):  
Jing Cun Bi ◽  
Qi Li ◽  
Wei Jun Yang ◽  
Yan Fei Liu
Keyword(s):  
Control Systems ◽  
Scheduling Algorithm ◽  
Network Control ◽  
Periodic Tasks ◽  
Aperiodic Tasks ◽  
Network Control Systems ◽  
Feedback Scheduling ◽  
Simulation Results ◽  
Adaptive Bandwidth ◽  
Keyword Network

As for the aperiodic tasks of node in network control systems, the FC-ABS (Feedback Controlled Adaptive Bandwidth Server) scheduling algorithm is designed. The different scheduling methods are used according to time characteristics of aperiodic tasks, and feedback scheduling is used to mitigate the effect of aperiodic tasks on periodic tasks. The simulation results show that the method is effective. Keyword: Network Control Systems; Server Scheduling; Feedback Scheduling; FC-ABS.

A Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks

2012 ◽  
pp. 316-333
Author(s):  
Shaohua Teng ◽  
Wei Zhang ◽  
Haibin Zhu ◽  
Xiufen Fu ◽  
Jiangyi Su ◽  
...  
Keyword(s):  
Scheduling Algorithm ◽  
Time Slice ◽  
Periodic Tasks ◽  
Variable Time ◽  
A Priority

The LLF (Least Laxity First) scheduling algorithm assigns a priority to a task according to its executing urgency. The smaller the laxity value of a task is, the sooner it needs to be executed. When two or more tasks have same or approximate laxity values, LLF scheduling algorithm leads to frequent switches among tasks, causes extra overhead in a system, and therefore, restricts its application. The least switch and laxity first scheduling algorithm is proposed in this paper by searching out an appropriate common divisor in order to improve the LLF algorithm for periodic tasks.

Sign in / Sign up

Export Citation Format

Share Document