Abstract
Recently various real-time scheduling algorithms are being studied in order to maximize throughput per unit time in real-time disk scheduling. Particularly in many algorithms, SCAN technique is applied to EDF(Earliest Deadline First), which represents real-time disk scheduling algorithms. However, proposed algorithms have many restrictions because they have to consider I/O requests that continue to be made while SCAN groups are being created. In addition, the fixed service direction in the SCAN technique lowers the efficiency of the disk. In order to solve the problem, this paper proposed a new real-time disk scheduling algorithm based on the insertion technique and the two-way SCAN technique and proved the superiority of the proposed system in terms of throughput per unit time and serviceable I/O requests through an experiment.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
