Analysis of tree-shaped transactions in distributed real time systems
2004 (English)In: 16TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2004, 239-248 p.Conference paper (Refereed)
A worst case response time analysis exploiting precedence constraints between fixed priority scheduled tasks in tree-shaped transactions is presented. The algorithm extends existing methods for analysis of linear transactions allowing a wider range of systems, in which tasks may trigger more than one succeeding task on their completion, i.e. the transactions form trees. It also improves existing methods, producing tighter response time bounds for tasks in both linear and tree-shaped transactions. The improvement is due to better exploitation of the precedence relations between tasks, which also makes the analysis faster than earlier. Simulation results show a significant reduction of estimated worst case response times when compared to earlier analysis methods for both linear and tree-shaped transactions. Such improvement leads to less pessimistic schedulability tests for distributed fixed priority scheduled systems.
Place, publisher, year, edition, pages
2004. 239-248 p.
, Euromicro Workshop on Real-Time Systems-Proceedings, ISSN 1068-3070
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-44328ISI: 000222970300026ScopusID: 2-s2.0-5644226404ISBN: 0-7695-2176-2OAI: oai:DiVA.org:kth-44328DiVA: diva2:451087
16th Euromicro Conference on Real-Time Systems Location: Catania, ITALY Date: JUN 30-JUL 02, 2004
QC 201110242011-10-242011-10-202011-10-24Bibliographically approved