From Task Scheduling in Single Processor Environments to Message Scheduling in a PROFIBUS Fieldbus Network

摘要

In this paper we survey the most relevant rsuts for the priority-based schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the ocmmunication schedulability analysis. We define an architcture to support priority-based schedulig of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages' response time, overcoming the limitation of the first-come-first-served PROFIBUS queue implementation.