Algorithms for Determining the Demand-Based Load of a Sporadic Task System

@article{Fisher2006AlgorithmsFD,
  title={Algorithms for Determining the Demand-Based Load of a Sporadic Task System},
  author={Nathan Fisher and Theodore P. Baker and Sanjoy K. Baruah},
  journal={12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)},
  year={2006},
  pages={135-146}
}
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time interval, normalized by the length of the interval. This parameter is known to play a very important role in the uniprocessor feasibility analysis of sporadic task systems. In this paper, it is shown that the load of a sporadic task system may be used as an accurate indicator of its feasibility upon preemptive… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 41 CITATIONS

Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling

  • Journal of Systems Architecture - Embedded Systems Design
  • 2011
VIEW 4 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

A Necessary and Sometimes Sufficient Condition for the Feasibility of Sets of Sporadic Hard-Deadline Tasks

  • 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06)
  • 2006
VIEW 18 EXCERPTS
CITES BACKGROUND & METHODS

Thermal-Aware Global Real-Time Scheduling on Multicore Systems

  • 2009 15th IEEE Real-Time and Embedded Technology and Applications Symposium
  • 2009
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES