History-Aware Dynamic Quantum Time Allocation for Round Robin Scheduling
8th International Congress on Human-Computer Interaction, Optimization and Robotic Applications, ICHORA 2026, Ankara, Türkiye, 21 - 23 Mayıs 2026, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Doi Numarası: 10.1109/ichora69329.2026.11537102
- Basıldığı Şehir: Ankara
- Basıldığı Ülke: Türkiye
- Anahtar Kelimeler: Dynamic Quantum Time, Round Robin, Scheduling
- Hacettepe Üniversitesi Adresli: Evet
Özet
In Round Robin scheduling, fixed time quanta often lead to excessive and costly context switches, making dynamic quantum allocation a superior choice for enhancing system performance. However, determining the optimal length for such a quantum remains a complex decision problem due to the unpredictable nature of task characteristics. In this study, we present a history-aware dynamic quantum time allocation method that dynamically adapts the time quantum using cached execution history. The proposed approach leverages past execution behavior to estimate future task characteristics, enabling more informed scheduling decisions under dynamic workload conditions. We implemented the scheduler in a discrete-event simulation environment using synthetic workloads. The results demonstrate that the proposed approach achieves lower average waiting time, turnaround time, and context switch count compared to the generic round robin scheduling algorithm.