Online task interleaving scheduling for the digital array radar |
| |
| Affiliation: | 1. Air and Missile Defense College, Air Force Engineering University, Shaanxi Xi’an 710051, PR China;2. Unit 94710, Jiangsu Wuxi 214000, PR China;3. Unit 94921, Fujian Jinjiang 362200, PR China;1. College of Astronautics, Nanjing University of Aeronautics and Astronautics, Nanjing, China;2. School of Information and Communication Engineering, Dalian University of Technology, Dalian, China;1. Department of Electrical Engineering, King Saud University, Riyadh 11421, Saudi Arabia;2. Prince Sultan Advanced Technology Research Institute, King Saud University, Riyadh 11421, Saudi Arabia;3. KACST Technology Innovation Center in RF and Photonics (RFTONICS), King Saud University, Riyadh 11421, Saudi Arabia;4. Electrical and Computer Engineering Department, Concordia University, Montreal, Canada;1. Institute of Space Electronics and Information Technology, School of Electronic Science and Engineering, National University of Defense Technology, China;2. Department of Signal Processing and Acoustics, Aalto University, Finland;3. China Academy of Electronics and Information Technology, China Electronics Technology Group Corporation, China;1. National Research Center of Railway Safety Assessment, Beijing Jiaotong University, Beijing 100044, China;2. State Key Lab of Rail Traffic Control & Safety, Beijing Jiaotong University, Beijing 100044, China |
| |
| Abstract: | Aiming at the task scheduling problem in the DAR (digital array radar), an online task interleaving scheduling algorithm is proposed. The full structure of the DAR task is explicitly considered in a way that the waiting duration can be utilized to transmit or receive subtasks, which is called the task interleaving, as well as the receiving durations of different tasks can be overlapped. The algorithm decomposes the task interleaving analysis into the time resource constraint analysis and the energy resource constraint analysis, and online schedules all kinds of tasks that can be interleaved. Thereby the waiting durations and receiving durations can be fully utilized. The simulation results demonstrate that the proposed algorithm improves the successfully scheduling ratio by 73%, the high value ratio by 86% and the time utilization ratio by 55% compared with the HPEDF (highest priority and earliest deadline first) algorithm. |
| |
| Keywords: | Digital array radar Task scheduling Task interleaving |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
