ANALYSIS AND HEURISTIC SCHEDULING FOR PERIODIC MESSAGES IN FF SYSTEM
Yue Zhou Haibin Yu Tianran Wang Baolin Zhu
No. 3 Laboratory, Shenyang Institute of Automation, Chinese Academy of Sciences No. 114 Nanta Street, Shenyang 110016 P. R. China E-mail: zhouyue@ms.sia.ac.cn
The remote periodic message not only has time constraints but also often has precedence constrains in Foundation Fieldbus system. In this paper, analysis and heuristic scheduling for remote periodic messages are proposed. Firstly, precedence constrains are considered and described by modifying releases times and deadlines of remote periodic messages. Secondly, a heuristic algorithm for building FF schedule time list is proposed to find acceptable scheduling solutions by some simple strategies in order to meet the requirement of these messages real-time communication. Finally, an example of application shows the process of building FF schedule time list.
Keywords: FF schedule time list, precedence constraints, real-time communication, non-preemptive, heuristic algorithm
Session slot T-Mo-M21: Posters of Industrial Applications/Area code 9d : Algorithms and Architectures for Real-Time Control

|