<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Home on Jaeyoung Lee</title><link>https://sleepylee02.github.io/</link><description>Recent content in Home on Jaeyoung Lee</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Tue, 31 Mar 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sleepylee02.github.io/index.xml" rel="self" type="application/rss+xml"/><item><title>On Probabilistic Schedulability Analysis [A Survey of Probabilistic Schedulability Analysis Techniques for Real-Time Systems]</title><link>https://sleepylee02.github.io/study/2026-03-31-/</link><pubDate>Tue, 31 Mar 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-03-31-/</guid><description>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.</description></item><item><title>Reducing WCDFP for EDF [Reducing Worst-Case Deadline Failure Probability for EDF Scheduling]</title><link>https://sleepylee02.github.io/study/2026-03-17-reducing-wcdfp-for-edf/</link><pubDate>Tue, 17 Mar 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-03-17-reducing-wcdfp-for-edf/</guid><description>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&amp;hellip; Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>Research Topic Exploration</title><link>https://sleepylee02.github.io/study/2026-03-03-exploring-topics/</link><pubDate>Tue, 03 Mar 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-03-03-exploring-topics/</guid><description>Why This Note Papers on probabilistic rts and mixed-criticality Focusing on RTSS, RTAS 24 &amp;amp; 25 Key Takeaways Let&amp;rsquo;s explore more on probabilistic timing guarantee Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>PAGFN [Priority-Aware Attention Meets Generative Flow Networks for Global Fixed-Priority Assignment]</title><link>https://sleepylee02.github.io/study/2026-02-13-pagfn/</link><pubDate>Fri, 13 Feb 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-02-13-pagfn/</guid><description>Why This Note Priority-Aware Attention Meets Generative Flow Networks for Global Fixed-Priority Assignment (RTSS'25) Key Takeaways Using GFlowNet for global fixed priority assignment Small margin to improve on GFP issue Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>CROS-RT [Cross-Layer Priority Scheduling for Predictable Inter-Process Communication in ROS 2]</title><link>https://sleepylee02.github.io/study/2026-02-06-cros-rt/</link><pubDate>Fri, 06 Feb 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-02-06-cros-rt/</guid><description>What I Studied CROS-RT: Cross-Layer Priority Scheduling for Predictable Inter-Process Communication in ROS 2 (RTAS'25) Key Takeaways Inter-process communication between layer Processing chains from ROS Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>MC-SDN [Supporting Mixed-Criticality Scheduling on Switched-Ethernet Using Software-Defined Networking]</title><link>https://sleepylee02.github.io/study/2026-01-30-mc-sdn/</link><pubDate>Fri, 30 Jan 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-01-30-mc-sdn/</guid><description>What I Studied MC-SDN: Supporting Mixed-Criticality Scheduling on Switched-Ethernet Using Software-Defined Networking (RTSS'18) Key Takeaways Mixed-Criticality Mimicking real-time in network Proactive Management System Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>RT-Swap [Addressing GPU Memory Bottlenecks for Real-Time Multi-DNN Inference]</title><link>https://sleepylee02.github.io/study/2026-01-23-rt-swap/</link><pubDate>Fri, 23 Jan 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-01-23-rt-swap/</guid><description>What I Studied RT-Swap: Addressing GPU Memory Bottlenecks for Real-Time Multi-DNN Inference (RTAS'24) Key Takeaways Transparent design Beautiful implementation Proactive Management System Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>PAL [ML for RT: Priority Assignment Using Machine Learning]</title><link>https://sleepylee02.github.io/study/2026-01-16-pal/</link><pubDate>Fri, 16 Jan 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-01-16-pal/</guid><description>What I Studied ML for RT: Priority Assignment Using Machine Learning (RTSS'21) Key Takeaways More on global fixed priority assignment Using NN on GFP assignment Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>Iterative-BCL [Schedulability analysis of global scheduling algorithms on multiprocessor platforms]</title><link>https://sleepylee02.github.io/study/2026-01-09-iterative-bcl/</link><pubDate>Fri, 09 Jan 2026 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2026-01-09-iterative-bcl/</guid><description>What I Studied Schedulability analysis of global scheduling algorithms on multiprocessor platforms (TPDS'08) Key Takeaways Checking schedulability on multiprocessor system Done is better than perfect Attachment Slides (PDF) Preview is not available. Open the PDF.</description></item><item><title>Pre-RTCL: Why Real-Time Systems?</title><link>https://sleepylee02.github.io/study/2025-12-30-pre-rtcl/</link><pubDate>Tue, 30 Dec 2025 00:00:00 +0000</pubDate><guid>https://sleepylee02.github.io/study/2025-12-30-pre-rtcl/</guid><description>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.</description></item></channel></rss>