The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1993 vol.19)
pp: 70-84
ABSTRACT
<p>The authors explain why pre-run-time scheduling is essential if one wishes to guarantee that timing constraints will be satisfied in a large complex hard-real-time system. They examine some of the major concerns in pre-run-time scheduling and consider what formulations of mathematical scheduling problems can be used to address those concerns. This work provides a guide to the available algorithms.</p>
INDEX TERMS
timing constraints; hard-real-time systems; pre-run-time scheduling; mathematical scheduling problems; operating systems (computers); real-time systems; scheduling
CITATION
J. Xu, D.L. Parnas, "On Satisfying Timing Constraints in Hard-Real-Time Systems", IEEE Transactions on Software Engineering, vol.19, no. 1, pp. 70-84, January 1993, doi:10.1109/32.210308
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool