Fixed-priority sensitivity analysis for linear compute time models
- 1 April 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 20 (4) , 308-317
- https://doi.org/10.1109/32.277577
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A partial evaluator for the Maruti hard real-time systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A Practitioner’s Handbook for Real-Time AnalysisPublished by Springer Nature ,1993
- Real-time scheduling theory and AdaComputer, 1990
- Fixed priority scheduling of periodic task sets with arbitrary deadlinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasksPublished by Association for Computing Machinery (ACM) ,1988
- Toward real-time performance benchmarks for AdaCommunications of the ACM, 1986
- The Science of ProgrammingPublished by Springer Nature ,1981
- Social processes and proofs of theorems and programsCommunications of the ACM, 1979
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973