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
Modern operating systems use multiprogramming and virtual memory to run multiple programs efficiently. When memory demand is high, excessive page swapping causes thrashing, degrading performance. This work introduces a thrashing-aware dynamic priority scheduler (TADPS) that uses page fault frequency to guide CPU scheduling. Processes with high page faults get lower priority, allowing others to progress efficiently. Tests under different memory pressures show that this approach improves CPU use, throughput, and stability compared with baseline schedulers such as FCFS and RR. Specifically, TADPS maintained superior throughput and efficiency, and consistently lower average turnaround time than FCFS and RR.
Included in
GRP-0200 TADPS: Thrashing-Aware Dynamic Priority Scheduler for Virtual Memory Systems
https://www.kennesaw.edu/ccse/events/computing-showcase/fa25-cday-program.php
Modern operating systems use multiprogramming and virtual memory to run multiple programs efficiently. When memory demand is high, excessive page swapping causes thrashing, degrading performance. This work introduces a thrashing-aware dynamic priority scheduler (TADPS) that uses page fault frequency to guide CPU scheduling. Processes with high page faults get lower priority, allowing others to progress efficiently. Tests under different memory pressures show that this approach improves CPU use, throughput, and stability compared with baseline schedulers such as FCFS and RR. Specifically, TADPS maintained superior throughput and efficiency, and consistently lower average turnaround time than FCFS and RR.