In this paper we survey the most relevant results 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 communication schedulability analysis. We define an architecture to support priority-based scheduling 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 (FCFS) PROFIBUS queue implementations.
CITATION STYLE
Tovar, E., & Vasques, F. (1999). From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1586, pp. 339–352). Springer Verlag. https://doi.org/10.1007/BFb0097916
Mendeley helps you to discover research relevant for your work.