On Satisfying Timing Constraints in Hard-Real-Time Systems

  • Authors:
  • J. Xu;D. L. Parnas

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1993

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.