A Multiframe Model for Real-Time Tasks
IEEE Transactions on Software Engineering
Real-Time Systems
Scheduling of conditional process graphs for the synthesis of embedded systems
Proceedings of the conference on Design, automation and test in Europe
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
Real-Time Systems
Scheduling for Embedded Real-Time Systems
IEEE Design & Test
A General Model for Recurring Real-Time Tasks
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Schedulability analysis for systems with data and control dependencies
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Scheduling and Mapping of Conditional Task Graphs for the Synthesis of Low Power Embedded Systems
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Interactive schedulability analysis
ACM Transactions on Embedded Computing Systems (TECS)
Schedulability analysis of non-preemptive recurring real-time tasks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like network processors, are either not preemptable or have restrictions on the number of preemptions allowed. All the previous work on the schedulability analysis of such systems either have exponential complexity, or allow unbounded number of preemptions and are usually based on heuristics. In this paper we present the exact necessary and sufficient conditions under EDF, for the schedulability of such a collection of code blocks in a non-preemptive environment, and give efficient algorithms for testing them. We validate our analytical results with experiments and show that the schedulability analysis problem in such systems can be exactly and efficiently solved in practice.