A practitioner's handbook for real-time analysis
A practitioner's handbook for real-time analysis
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
FUNDAMENTAL DESIGN PROBLEMS OF DISTRIBUTED SYSTEMS FOR THE HARD-REAL-TIME ENVIRONMENT
Multiprocessor EDF and Deadline Monotonic Schedulability Analysis
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series)
An Analysis of Fixed-Priority Schedulability on a Multiprocessor
Real-Time Systems
Algorithms for Determining the Demand-Based Load of a Sporadic Task System
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Handbook of Real-Time and Embedded Systems
Handbook of Real-Time and Embedded Systems
New schedulability tests for real-time task sets scheduled by deadline monotonic on multiprocessors
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
A real-time framework for multiprocessor platforms using Ada 2012
Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
Preliminary multiprocessor support of ada 2012 in GNU/Linux systems
Ada-Europe'10 Proceedings of the 15th Ada-Europe international conference on Reliable Software Technologies
CloudIQ: a framework for processing base stations in a data center
Proceedings of the 18th annual international conference on Mobile computing and networking
FPSL, FPCL and FPZL schedulability analysis
Real-Time Systems
Adding multiprocessor and mode change support to the Ada real-time framework
ACM SIGAda Ada Letters
| Hi-index | 0.01 |
Fixed Task Priority (FTP) scheduling algorithms are priority-driven scheduling algorithms in which all jobs generated by each recurrent task are restricted to have the same priority. The multiprocessor FTP scheduling of sporadic task systems is studied in this paper. A new sufficient schedulability test is presented and proved correct. It is shown that this test offers non-trivial quantitative guarantees, including a processor speedup bound.