From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

• Type: Article in International Conference Proceedings Book
• Date: 1999

Authors

tovar, e (Author) Other; Francisco Vasques (Author) FEUP

Conference proceedings International

Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Pages: 339-352

13th International Parallel Processing Symposium, IPPS 1999 Held in Conjunction with the 10th Symposium on Parallel and Distributed Processing, SPDP 1999

12 April 1999 through 16 April 1999

Indexing

Scopus - 4 Citations

Other information

Authenticus ID: P-008-WV8

DOI: 10.1007/bfb0097916

Abstract (EN): 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. © Springer-Verlag Berlin Heidelberg 1999.

Language: English

Type (Professor's evaluation): Scientific