Title :
Optimal scheduling algorithm for multi-tasks in distributed control systems
Author_Institution :
Sch. of Electr. & Electron. Eng., Nanjing Normal Univ., Nanjing, China
Abstract :
There are real-time periodic tasks and non-real-time sporadic tasks in Distributed Control System (DCS) and how to schedule these tasks influences not only on the resource utilization of system, but also on the control performance of system. Firstly, task models and system model are given in this paper. A scheduling algorithm called dual-priority queue scheduling algorithm is presented for uniprocessor and the schedulable condition is given. Based on this, the task scheduling algorithm for DCS is investigated based on heuristic task allocation method. According to the relationship of the performance of DCS and sampling periods of periodic tasks, particle swarm optimization (PSO) algorithm is applied to optimize the performance index of DCS. Simulation results show that the performance index of DCS can be improved obviously in the case that the schedulability of all tasks is guaranteed by adopting the algorithm presented in this paper.
Keywords :
distributed control; particle swarm optimisation; processor scheduling; resource allocation; sampling methods; DCS; PSO algorithm; distributed control systems; dual-priority queue scheduling algorithm; heuristic task allocation method; nonreal-time sporadic tasks; optimal multitask scheduling algorithm; particle swarm optimization algorithm; performance index optimization; real-time periodic tasks; resource utilization; sampling periods; schedulable condition; system performance control; uniprocessor; Algorithm design and analysis; Control systems; Heuristic algorithms; Optimal scheduling; Program processors; Resource management; Scheduling algorithms; Distributed Control System (DCS); Particle swarm optimization (PSO); Scheduling algorithm; heuristic task allocation;
Conference_Titel :
Control and Decision Conference (CCDC), 2013 25th Chinese
Conference_Location :
Guiyang
Print_ISBN :
978-1-4673-5533-9
DOI :
10.1109/CCDC.2013.6561481