Abstract

The remote periodic message not only has timing 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 release 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 these messages' timing constraints. Finally, an example of application shows the process of building FF schedule time list.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.