Tasks Scheduling in PAC System Based on Heuristic Shortest Path Algorithm

DOI

10.2991/icecee-15.2015.173How to use a DOI?

Keywords

PAC system; Hybrid tasks scheduling; Shortest-path algorithm; Heuristic search

Abstract

Considering the characteristics of Programmable Automation Controller (PAC) real-time system, which is consisting of hybrid tasks with precedence orders constraints, a new model for hybrid-task system is introduced. Choosing a task execution sequence is instead of finding the shortest path between state nodes in State-space Tree (SST). By searching state nodes in SST and minimizing the value of heuristic evaluation function, Shortest-path Algorithm (SPA) based on heuristic search is presented to schedule hybrid-task sets in PAC system. Case study and analysis prove that the algorithm is able to obtain the optimized sequence of hybrid task sets in PAC system effectively.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhengyi Liu
AU  - Chongquan Zhong
PY  - 2015/06
DA  - 2015/06
TI  - Tasks Scheduling in PAC System Based on Heuristic Shortest Path Algorithm
BT  - Proceedings of the 2015 International Conference on Electrical, Computer Engineering and Electronics
PB  - Atlantis Press
SP  - 905
EP  - 910
SN  - 2352-538X
UR  - https://doi.org/10.2991/icecee-15.2015.173
DO  - 10.2991/icecee-15.2015.173
ID  - Liu2015/06
ER  -