TY - GEN
T1 - Preemptive dynamic scheduling algorithm for data relay satellite systems
AU - Deng, Boyu
AU - Jiang, Chunxiao
AU - Kuang, Linling
AU - Guo, Song
AU - Ge, Ning
AU - Lu, Jianhua
PY - 2017/7/28
Y1 - 2017/7/28
N2 - In data relay satellite (DRS) systems, the performance of tasks scheduling is influenced by the variation of task and resources, which degrades the processing capacity of relay satellites. Considering this problem, we investigate the dynamic scheduling in the application of DRS. To achieve the efficient resource utilization and reliable data transfer, the strategies of task preemptive switching and decomposition are designed. Based on the initial scheme, we construct a dynamic scheduling model with multiple objectives, including maximizing the total weight of scheduled tasks, minimizing the change of scheduling scheme and minimizing the number of decomposed subtasks. Meanwhile, a preemptive dynamic scheduling algorithm (PDSA) is designed to solve the proposed model. Explicitly, our simulation results show that PDSA is superior to the whole rescheduling algorithm (WRA) in quantities of completed tasks, rescheduling rate of scheme and processing time, which can efficiently improve the performance of dynamic scheduling in DRS systems.
AB - In data relay satellite (DRS) systems, the performance of tasks scheduling is influenced by the variation of task and resources, which degrades the processing capacity of relay satellites. Considering this problem, we investigate the dynamic scheduling in the application of DRS. To achieve the efficient resource utilization and reliable data transfer, the strategies of task preemptive switching and decomposition are designed. Based on the initial scheme, we construct a dynamic scheduling model with multiple objectives, including maximizing the total weight of scheduled tasks, minimizing the change of scheduling scheme and minimizing the number of decomposed subtasks. Meanwhile, a preemptive dynamic scheduling algorithm (PDSA) is designed to solve the proposed model. Explicitly, our simulation results show that PDSA is superior to the whole rescheduling algorithm (WRA) in quantities of completed tasks, rescheduling rate of scheme and processing time, which can efficiently improve the performance of dynamic scheduling in DRS systems.
KW - DRS systems
KW - dynamic resource scheduling
KW - heuristic algorithm
KW - preemptive task-switching
KW - sub-task division
UR - http://www.scopus.com/inward/record.url?scp=85028332238&partnerID=8YFLogxK
U2 - 10.1109/ICC.2017.7996552
DO - 10.1109/ICC.2017.7996552
M3 - Conference article published in proceeding or book
AN - SCOPUS:85028332238
T3 - IEEE International Conference on Communications
BT - 2017 IEEE International Conference on Communications, ICC 2017
A2 - Debbah, Merouane
A2 - Gesbert, David
A2 - Mellouk, Abdelhamid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Communications, ICC 2017
Y2 - 21 May 2017 through 25 May 2017
ER -