Optimized Universal Adaptive Disk Scheduling Algorithm using Multiparameter Priority

Disk scheduling is crucial for optimizing the performance of storage systems, where request sequencing directly impacts efficiency. This work addresses the problem of inefficient disk request processing by introducing a dynamic disk scheduling system based on a multiparameter priority algorithm. The system recalculates priorities dynamically, processing requests in real time without manual intervention. Uniquely, the proposed system considers multiple factors like deadline, request age, proximity to head position, and frequency of access to prioritize disk requests. This leads to reduced response time and improved performance metrics. Experimental results indicate that our system outperforms traditional disk scheduling algorithms by reducing average response time, enhancing throughput, and maintaining consistent head positioning across different workloads. The system demonstrates practical relevance in scenarios requiring high-speed disk operations with real-time request handling.