Why This Note#

  • A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems (LITES’19: Leibniz Transactions on Embedded Systems)
  • Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems (ECRTS’18)
  • Efficiently Approximating the Worst-Case Deadline Failure Probability Under EDF (RTSS’21)
  • Reducing Worst-Case Deadline Failure Probability for EDF Scheduling (RTSS’25)

Key Takeaways#

  • Understanding how idea of probabilistic timing guarantee works
  • focusing on pWCRT, DMP, WCDFP, Independence, Job abort, Job continue, and few other principle idea on probabilistic timing guarantee.
  • Revisit the RTSS'25 paper seen previously

Attachment#