This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Guaranteed Response Times in a Hard-Real-Time Environment
January 1980 (vol. 6 no. 1)
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.
Index Terms:
real-time programming, Guaranteed response time, hard-real-time, multiprocessing
Citation:
D.W. Leinbaugh, "Guaranteed Response Times in a Hard-Real-Time Environment," IEEE Transactions on Software Engineering, vol. 6, no. 1, pp. 85-91, Jan. 1980, doi:10.1109/TSE.1980.234465
Usage of this product signifies your acceptance of the Terms of Use.