Task scheduling algorithm based on backtracking strategy for phased array radar

2021 ◽  
Author(s):  
Yi Duan ◽  
Chang Liu ◽  
Zhiguo Qu ◽  
Jiancheng Zheng
Keyword(s):  
Task Scheduling ◽  
Phased Array ◽  
Scheduling Algorithm ◽  
Phased Array Radar ◽  
Task Scheduling Algorithm

scholarly journals A Task Scheduling Algorithm for Phased-Array Radar Based on Dynamic Three-Way Decision

Sensors ◽  
2019 ◽  
Vol 20 (1) ◽  
pp. 153
Author(s):  
Bo Li ◽  
Linyu Tian ◽  
Daqing Chen ◽  
Yue Han
Keyword(s):  
Task Scheduling ◽  
Phased Array ◽  
Scheduling Algorithm ◽  
Potential Threat ◽  
Phased Array Radar ◽  
Task Scheduling Algorithm ◽  
Threat Level ◽  
The Difference ◽  
High Threat ◽  
Time Resource

The time resource management of phased-array radars is the key to fulfilling their performance, such as how phased-array radar can efficiently and reasonably schedule tasks under limited resources. Therefore, this paper proposes a task scheduling algorithm for phased-array radar based on dynamic three-way decision. The algorithm introduces three-way decision into the scheduling algorithm and divides the target into three threat areas according to the threat degree (i.e., threat area, nonthreat area, and potential threat area). Different threat domains are assigned different weights and combine the working mode and the task deadline to carry out comprehensive priority planning, so that the radar can reasonably allocate time according to the difference of the target threat level and the threat area in the tracking stage. In addition, an improved adaptive threshold algorithm is proposed to obtain a dynamic three-way decision to achieve the adaptation of the algorithm. A set of performance indicators have been defined to evaluate the algorithm. The relevant experiments have demonstrated that the proposed algorithm can effectively improve the processing capability of phased-array radars when dealing with high-threat targets.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Sign in / Sign up

Export Citation Format

Share Document