The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior

@inproceedings{Lehoczky1989TheRM,
  title={The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior},
  author={John P. Lehoczky and Lui Sha and Yan Ding},
  booktitle={RTSS},
  year={1989}
}
deadlines all of the time if the rate monotonic algorithm is used and the total utilization is not greater than .693. This paper presents an exact characterization of the ability of the rate monotonic scheduling algorithm to meet the Liu and Layland [3] also found that the optimal dynamic deadlines of a periodic task set. In addition, a stochastic scheduling algorithm was the nearest deadline algorithm. analysis is presented which gives the probability This algorithm was shown to have a worst… CONTINUE READING
Highly Influential
This paper has highly influenced 103 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 1,259 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 819 extracted citations

1,259 Citations

050'88'94'01'08'15
Citations per Year
Semantic Scholar estimates that this publication has 1,259 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Aperiodic case behavior . Specific $ ly , when B = 1 , the average Case Scheduling in A Hard Real - Time Environment " Task synchronization in real - time systems

  • J. P. Lehoczky
  • 1989

The above example is particularly interesting, because it 1986). provides an illustration of a situation in which the asymptotic average case behavior coincides with the worst

  • U log, WI IIBIBJc, a.s
  • 1986

Similar Papers

Loading similar papers…