From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network
In this paper we survey the most relevant results for the prioritybased 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 communica...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2014
|
| Texto completo: | http://hdl.handle.net/10400.22/3564 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3564 |
| Resumo: | In this paper we survey the most relevant results for the prioritybased 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. |
|---|