Preemptively scheduling hard-real-time sporadic tasks on one processor

@article{Baruah1990PreemptivelySH,
  title={Preemptively scheduling hard-real-time sporadic tasks on one processor},
  author={Sanjoy K. Baruah and Aloysius K. Mok and Louis E. Rosier},
  journal={[1990] Proceedings 11th Real-Time Systems Symposium},
  year={1990},
  pages={182-190}
}
Consideration is given to the preemptive scheduling of hard-real-time sporadic task systems on one processor. The authors first give necessary and sufficient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested efficiently (unless P=NP). They do, however, lead to a feasibility test that runs in efficient pseudo-polynomial time for a very large percentage of sporadic task systems.<<ETX>> 

Topics from this paper.

Citations

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

Bounding and shaping the demand of generalized mixed-criticality sporadic task systems

  • Real-Time Systems
  • 2013
VIEW 15 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Models and Complexity Results in Real-Time Scheduling Theory

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Approximative real-time analysis

VIEW 24 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Maintaining Data Freshness in Distributed Cyber-Physical Systems

  • IEEE Transactions on Computers
  • 2019
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Complexity of Uniprocessor Scheduling Analysis

VIEW 17 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate

  • 2018 IEEE Real-Time Systems Symposium (RTSS)
  • 2018
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1991
2019

CITATION STATISTICS

  • 107 Highly Influenced Citations

  • Averaged 18 Citations per year from 2017 through 2019

References

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

Exploit - ing unused periodic time for aperiodic service using the extended priority exchange algorithm

L. Sha Sprunt, J. Lehoczky
  • Schedul - ing sporadic and aperiodic events in a hard real - time system
  • 1989

hanced aperiodic responsiveness in hard real - time environments On the complexity of fixed - priority scheduling of periodic , real - time tasks

J. Lehoczky Sprunt
  • Fundamental Design Problems of Distributed Systems for the Hard Real - Time Environment . PhD thesis
  • 1982