Guaranteed Response Times in a Hard-Real-Time Environment
- 1 January 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-6 (1), 85-91
- https://doi.org/10.1109/tse.1980.234465
Abstract
This paper describes a scheduling algorithm for a set of tasks that guarantees the time within which a task, once started, will complete. A task is started upon receipt of an external signal or the completion of other tasks. Each task has a rxed set of requirements in processor time, resources, and device operations needed for completion of its various segments. A worst case analysis of task performance is carried out. An algorithm is developed for determining the response times that can be guaranteed for a set of tasks. Operating system overhead is also accounted for.Keywords
This publication has 13 references indexed in Scilit:
- Preemptive Scheduling of Uniform Processor SystemsJournal of the ACM, 1978
- Scheduling tasks with critical sectionsPublished by Association for Computing Machinery (ACM) ,1977
- Scheduling Tasks with Nonuniform Deadlines on Two ProcessorsJournal of the ACM, 1976
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973
- Process synchronization without long-term interlockACM SIGOPS Operating Systems Review, 1972
- Hierarchical ordering of sequential processesActa Informatica, 1971
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor SystemsJournal of the ACM, 1970
- Production and Stabilization of Real-Time Task SchedulesJournal of the ACM, 1967