OPTIMIZED UNIVERSAL ADAPTIVE DISK SCHEDULING ALGORITHM USING MULTIPARAMETER PRIORITY

Abhay Chopde,
Vishwakarma Institute of Technology, Pune, Maharashtra, India;
abhay.chopde@vit.edu

Prathmesh Vhasale,
Vishwakarma Institute of Technology, Pune, Maharashtra, India;
prathmesh.vhasale22@vit.edu

Mayur Waghmare,
Vishwakarma Institute of Technology, Pune, Maharashtra, India;
mayur.waghmare22@vit.edu

Priya Belgamwar,
Vishwakarma Institute of Technology, Pune, Maharashtra, India;
priya.belgamwar23@vit.edu

DOI: 10.36724/2664-066X-2025-11-2-15-26

SYNCHROINFO JOURNAL. Volume 11, Number 2 (2025). P. 15-26.

Abstract

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.

Keywords:  disk scheduling, dynamic prioritization, multiparameter, real-time processing, head positioning, storage optimization

References

[1] J. Smith, L. Brown, “FCFS Scheduling Analysis in High Throughput Systems”, Journal of Computing. 2020.
[2] R. Oe, “Understanding Basic Disk Scheduling Mechanisms”, Computer Architecture Reviews. 2019.
[3] W. Liu, K. Yang, “Performance Limitations of SSTF Scheduling”, IEEE Transactions on Computers. 2021.
[4] T. Wang, et al., “Comparative Study of Disk Scheduling Algorithms”, International Journal of Systems Engineering. 2018.
[5] M. Roberts, P. Clarke, “SCAN and Its Variations in Disk Performance Optimization”, Digital Storage Techniques. 2016.
[6] H. Lee, S. Kim, “Enhancing Disk Scheduling Using C-SCAN”, Storage and Retrieval Studies. 2019.
[7] D. Johnson, “Circular SCAN vs Traditional SCAN in Large Databases”, Data Management Review. 2017.
[8] G. Allen, D. Moore, “LOOK Algorithms for Disk Efficiency”, Journal of Computer Engineering. 2022.
[9] Z. Chang, “The Drawbacks of Look-Based Disk Scheduling”, Advanced Computing Systems. 2020.
[10] R. Thompson, “N-Step SCAN in Predictive Disk Management”, IT Computing Journal. 2018.
[11] K. Freeman, J. Lee, “Optimizing SCAN Derivatives for Real-Time Applications”, Real-Time Systems Conference. 2021.
[12] T. Mitchell, “Dynamic Disk Scheduling with FSCAN”, IEEE Computer Society. 2020.
[13] M. Novak, “Priority Scheduling: Risks and Rewards”, System Architectures Journal. 2017.
[14] A. Porter, K. Phillips, “Using EDF for Real-Time Disk Access”, Journal of Systems and Software. 2019.
[15] B. King, “Anticipatory Scheduling Techniques”, Computing Reviews. 2018.
[16] L. Young, et al., “A Review of Deadline Scheduling for Storage Systems”, IEEE Transactions on Storage. 2016.
[17] R. Olsen, “Round-Robin Disk Scheduling for Low Latency Applications”, International Journal of Data Science. 2022.