Issue No. 01 - January (1993 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.210308
<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>
timing constraints; hard-real-time systems; pre-run-time scheduling; mathematical scheduling problems; operating systems (computers); real-time systems; scheduling
D. Parnas and J. Xu, "On Satisfying Timing Constraints in Hard-Real-Time Systems," in IEEE Transactions on Software Engineering, vol. 19, no. , pp. 70-84, 1993.