Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems
IEEE Transactions on Software Engineering
On-Line Scheduling of Real-Time Tasks
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
Biasing Effects in Schedulability Measures
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Scheduler implementation in MP SoC design
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Proceedings of the conference on Design, automation and test in Europe
ISORC '08 Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing
Scheduling Dependent Periodic Tasks without Synchronization Mechanisms
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Communications of the ACM
Journal of Systems Architecture: the EUROMICRO Journal
| Hi-index | 0.00 |
This paper addresses the global scheduling of constrained deadline periodic dependent task sets on multiprocessor platforms composed of identical processors. We propose two orthogonal approaches: (1) an off-line computation of a valid fixed priority assignment (2) a computation of an off-line schedule. The method in both cases is based on the efficient exploration of a finite automaton encoding all the possible executions. Even if the problems are NP-complete, we obtain rather reasonable performances as illustrated in the benchmarks.