International Journal of Pure and Applied Research in Engineering and Technology (IJPRET)
Real-Time Disk Scheduling (RTDS) plays an important role in time-critical applications. Due to rigorous timing requirements for error free output, data must be accessed under real-time constraints. Therefore, how to maximize data throughput under real-time constraints poses a big challenge in the design of real-time disk scheduling algorithms. Numbers of algorithms are proposed to schedule real time transactions in order to increase the overall performance. Currently Earliest-Deadline-First (EDF) is a basic algorithm which meets the real time constraints, but it gives poor disk throughput.