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.

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

2010 ◽  
Vol 2 (2) ◽  
pp. 86-104
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.

scholarly journals SELF OPTIMIZING KERNEL WITH HYBRID SCHEDULING ALGORITHM

2013 ◽  
pp. 66-70
Author(s):  
AMOL VENGURLEKAR ◽  
ANISH SHAH ◽  
AVICHAL KARIA
Keyword(s):  
Operating System ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Time Slice ◽  
System Efficiency ◽  
Scheduling Policies ◽  
Hybrid Scheduling ◽  
Variable Time ◽  
Average Waiting Time ◽  
Will Self

In this paper an operating system with a unique Hybrid scheduling algorithm (HSA) is proposed. The HSA incorporates the scheduling policies of both Round robin and priority based scheduling techniques along with a smart kernel which will self-optimize the system by providing a variable time slice to the tasks. The objective of developing this operating system is to improve the system efficiency and with an optimized usage of the resources available for the tasks, radically in terms of context switches and average waiting time.

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.

Ground Antenna Scheduling Algorithm for Multi-Satellite Tracking

2011 ◽  
Author(s):  
Sang-Hyuk Yun ◽  
Hyo-Sung Ahn ◽  
Sun-Ju Park ◽  
Ok-Chul Jung ◽  
Dae-Won Chung
Keyword(s):  
Weight Function ◽  
Greedy Algorithm ◽  
Scheduling Algorithm ◽  
Optimal Schedule ◽  
Satellite Tracking ◽  
Scheduling Problem ◽  
Depth First Search ◽  
Ground Station ◽  
A Priority

In this paper, we address the optimal ground antenna scheduling problem for multiple satellites when multiple satellites have visibility conflicts at a ground station. Visibility conflict occurs when multiple satellites have either overlapping visibilities at a ground station or difference with time of loss of signal (LOS) of a satellite and time of acquisition of signal (AOS) of another satellite is less than reconfiguration time of ground station. Each satellite has a priority value that is a weight function with various factors. Multi-antenna scheduling (MAS) algorithm 1 and Multi-antenna scheduling (MAS) algorithm 2 are proposed to find the optimal schedule of multi-antenna at a ground station using pre-assigned priority values of satellites. We use the depth first search (DFS) method to search the optimal schedule in MAS algorithm 1 and MAS algorithm 2. Through the simulations, we confirm the efficiency of these algorithms by comparing with greedy algorithm.

A multiprocessor-oriented power-conscious scheduling algorithm for periodic tasks

2013 ◽  
Vol 53 (1) ◽  
pp. 115-122
Author(s):  
Zheng Liu ◽  
Weiguo Zhao ◽  
Zhen Li ◽  
Hua Yan ◽  
Huijian Han
Keyword(s):  
Scheduling Algorithm ◽  
Periodic Tasks
Sign in / Sign up

Export Citation Format

Share Document