Modeling Preemptive EDF and FP by Integer Variables

@inproceedings{Bini2009ModelingPE,
  title={Modeling Preemptive EDF and FP by Integer Variables},
  author={Enrico Bini},
  year={2009}
}
The design of any system can be modeled by an optimization problem, where a decision must be taken to maximize an overall utility function within some constraints (that can be physical, contractual, etc.). In hard real-time systems the con- straints are specified by the deadlines that are set for the completion of tasks. However classic schedulability tests are formulated by algorithms that prevent a visualization of the feasible region of the designer choices. In this paper we formulate the… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 23 REFERENCES

Task period selection and schedulability in real-time systems

  • Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279)
  • 1990
VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Computing the Minimum EDF Feasible Deadline in Periodic Systems

  • 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
  • 2006
VIEW 2 EXCERPTS
HIGHLY INFLUENTIAL

Optimal task rate selection in fixed priority systems

  • 26th IEEE International Real-Time Systems Symposium (RTSS'05)
  • 2005
VIEW 2 EXCERPTS