Posts for: #Study-Note

On Probabilistic Schedulability Analysis [A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems]

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.
[]

Reducing WCDFP for EDF [Reducing Worst-Case Deadline Failure Probability for EDF Scheduling]

Why This Note Reducing Worst-Case Deadline Failure Probability for EDF Scheduling (RTSS'25) Key Takeaways Understanding how proabilistic timing guarantee works need to read more on past works Analysis of Deadline Miss Rates for Uniprocessor Fixed-Priority Scheduling (RTCSA'18) Efficiently Approximating the Worst-Case Deadline Failure Probability under EDF (RTSS'21) and so on… Attachment Slides (PDF) Preview is not available. Open the PDF.
[]

Pre-RTCL: Why Real-Time Systems?

Pre-RTCL: Why Real-Time Systems? Motivation My major is Applied Statistics, and I had been primarily studying data analysis. After taking an Operating Systems course and learning about data engineering, I became interested in systems in general, which led me to start a double major in Computer Science in the second semester (25-2). I had explored various areas including cloud systems and AI systems, but I was left wanting deeper, more focused study.
[]