Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Deadline Assignment in a Distributed Soft Real-Time System
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
Improved Schedulability Analysis of Real-Time Transactions with Earliest Deadline Scheduling
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
A Delay Composition Theorem for Real-Time Pipelines
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Cyclic dependencies in modular performance analysis
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Delay composition in preemptive and non-preemptive real-time pipelines
Real-Time Systems
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Memory-centric scheduling for multicore hard real-time systems
Real-Time Systems
| Hi-index | 0.00 |
A significant problem with no simple solutions in current real-time literature is analyzing the end-to-end schedulability of tasks in distributed systems with cycles in the task graph. Prior approaches including network calculus and holistic schedulability analysis work best for acyclic task flows. They involve iterative solutions or offer no solutions at all when flows are non-acyclic. This paper demonstrates the construction of the first generalized closed-form expression for schedulability analysis in distributed task systems with non-acyclic flows. The approach is a significant extension to our previous work on schedulability in Directed Acyclic Graphs. Our main result is a bound on end-to-end delay for a task in a distributed system with non-acyclic task flows. The delay bound allows one of several schedulability tests to be performed. Using the end-to-end delay bound, we extend the delay composition algebra developed for acyclic distributed systems in prior work, to handle loops in the task graph as well. Evaluation shows that the schedulability tests thus constructed are less pessimistic than prior approaches for large distributed systems.