Skip to content
Open access

Enhancing SJF and SRTF CPU Scheduling Through Machine Learning-Based Burst Time Prediction: A Comparative Study

Sep 2026 · International Journal of Emerging Engineering and Technology · 0 citations · 26 references

TL;DR

A comprehensive ML-based framework for CPU burst time prediction using a large-scale real-world workload dataset containing more than 404,000 processes and 29 features is developed and indicates strong potential for integrating ML-based burst time prediction into SJF and SRTF scheduling.

Abstract

Accurate prediction of CPU burst time is essential for effective process scheduling, particularly in Shortest Job First (SJF) and Shortest Remaining Time First (SRTF) algorithms. Traditional estimation techniques, such as exponential averaging, can produce substantial prediction errors, resulting in inefficient scheduling, increased waiting and turnaround times, and reduced system throughput. Although machine learning (ML) approaches have recently been investigated for CPU burst time prediction, existing studies are often limited by small datasets, restricted model comparisons, inadequate preprocessing, and insufficiently reproducible implementation frameworks. This study addresses these limitations by developing a comprehensive ML-based framework for CPU burst time prediction using a large-scale real-world workload dataset containing more than 404,000 processes and 29 features. The proposed framework evaluates a broad range of supervised regression algorithms, including Linear Regression, Ridge, Lasso, ElasticNet, Decision Tree, Random Forest, Gradient Boosting, AdaBoost, XGBoost, LightGBM, K-Nearest Neighbors, Support Vector Regression, and Multi-Layer Perceptron. The experimental pipeline incorporates exploratory data analysis, strict train-test separation to prevent data leakage, missing-value imputation, outlier capping, categorical encoding, feature engineering, and standardized performance evaluation using R², adjusted R², RMSE, MAE, and MAPE. Experimental results demonstrate that gradient-boosting approaches substantially outperform conventional and alternative ML models. XGBoost achieved the best performance, attaining a test R² of 0.872, RMSE of 487.3 s, MAE of 196.5 s, and MAPE of 14.2%, compared with approximately 0.70 R² and 30% MAPE for linear baselines. LightGBM achieved a comparable R² of 0.868 while reducing training time by 43%. Feature importance analysis identified AverageCPUTimeUsed, ReqTime, UsedMemory, and NProcs as the dominant predictors, collectively contributing more than 74% of predictive power. The findings indicate strong potential for integrating ML-based burst time prediction into SJF and SRTF scheduling. However, scheduler-level simulations and validation across diverse workload environments are required to quantify actual improvements in waiting time, turnaround time, and throughput.

Read PDF

Similar papers

Open access Aug 2026

Online Confidence-Gated LSTM-DQN for Dynamic Cloud Resource Allocation

A causally consistent, confidence-gated LSTM-DQN scheduler that trains stably and safely on every seed, holds response time and SLA violations in line with standard RL and simple heuristics, and clearly outperforms a metaheuristic-augmented Q-learning baseline.

Preeti Puranik, S. Sonare · 0 citations
Open access Sep 2026

Machine Learning-Based Runtime Prediction and Energy Optimization for HPC Job Scheduling Using the NREL Eagle Supercomputer Dataset

This work analyzes 7.3 million completed jobs from the NREL Eagle supercomputer and finds that the problem is far worse than previously reported: median time-limit utilization is just 6.7%, with users consuming a median of 10.6 minutes against 4-hour requests.

Renato Quispe-Vargas, Dina Maribel Yana-Yucra, Richar Andre Vilca-Solorzano et al. · 0 citations
Conference Open access 2026

Practical Prediction of Query Execution Time in PostgreSQL Using Lightweight Machine Learning Models

Accurate prediction of query execution time is important for workload scheduling, admission control, and service-level management in modern database systems. In PostgreSQL, the optimizer selects execution plans using internal cost estimates that reflect relative expected work rather than actual wall-clock runtime. This...

T. Balla · 0 citations
#machine learning Preprint Sep 2026

A Two-Stage Forecasting System for CPU Workload Prediction in Private Clouds

A two-stage integrated forecasting model is proposed that explicitly models the relationship between customer service demand and subsequent resource consumption, giving improved forecasting robustness, computational efficiency, and interpretability, making it well-suited for proactive resource management and intelligen...

Ashir Javeed, Anton Borg, Håkan Grahn et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.