Location
https://www.kennesaw.edu/ccse/events/computing-showcase/fa25-cday-program.php
Document Type
Event
Start Date
24-11-2025 4:00 PM
Description
We study whether deep learning can help the Linux CFS, which makes fair scheduling decisions without using historical behavior and may preempt tasks that are near completion. We adopt a dataset and baseline LSTM from earlier work and introduce a Transformer model to explore predictive scheduling. We train both on real scheduling traces to learn the next selected task and timing trends, and evaluate them using task classification accuracy and direction accuracy. Our results show that the LSTM remains the stronger baseline and captures CFS patterns more effectively than our Transformer model in this comparison under identical conditions for fairness.
Included in
GRP-0161 Predicting the Linux Scheduler’s Next Move with Transformers
https://www.kennesaw.edu/ccse/events/computing-showcase/fa25-cday-program.php
We study whether deep learning can help the Linux CFS, which makes fair scheduling decisions without using historical behavior and may preempt tasks that are near completion. We adopt a dataset and baseline LSTM from earlier work and introduce a Transformer model to explore predictive scheduling. We train both on real scheduling traces to learn the next selected task and timing trends, and evaluate them using task classification accuracy and direction accuracy. Our results show that the LSTM remains the stronger baseline and captures CFS patterns more effectively than our Transformer model in this comparison under identical conditions for fairness.