From Task Scheduling in Single Processor Environments to Message Scheduling in a Profibus Fieldbus Network Outdated
Ref: HURRAY-TR-9816 Publication Date: 1, Oct, 1998
From Task Scheduling in Single Processor Environments to Message Scheduling in a Profibus Fieldbus Network
Ref: HURRAY-TR-9816 Publication Date: 1, Oct, 1998Abstract:
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.
Notes: This technical report was later updated by HURRAY-TR-9902
Record Date: 1, Oct, 1998
Other Versions:
From Task Scheduling in Single Processor Environments to Message Scheduling in a Profibus Fieldbus Network (Dec 1899)7th International Workshop on Parallel and Distributed Real-Time Systems (WPDRTS'99)
Short links for this page: www.cister.isep.pt/docs/hurray_tr_9816 www.cister.isep.pt/docs/35