On satisfying timing constraints in hard-real-time systems
Jie Xu, David Lorge Parnas · IEEE Transactions on Software Engineering · 1993
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.>