The Community for Technology Leaders
Green Image
Issue No. 01 - January (1980 vol. 6)
ISSN: 0098-5589
pp: 85-91
D.W. Leinbaugh , Department of Computer Science, University of Nebraska
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.
real-time programming, Guaranteed response time, hard-real-time, multiprocessing

D. Leinbaugh, "Guaranteed Response Times in a Hard-Real-Time Environment," in IEEE Transactions on Software Engineering, vol. 6, no. , pp. 85-91, 1980.
87 ms
(Ver 3.3 (11022016))