• Apr 24, 2023 News!IJCTE Vol. 15, No. 1 has been indexed by SCOPUS.   [Click]
  • May 04, 2023 News!IJCTE Vol.15, No.2 has been published.   [Click]
  • Feb 08, 2023 News!IJCTE Vol. 14, No. 4 has been indexed by SCOPUS.   [Click]
General Information
    • ISSN: 1793-8201 (Print)
    • Abbreviated Title: Int. J. Comput. Theory Eng.
    • Frequency: Quarterly
    • DOI: 10.7763/IJCTE
    • Editor-in-Chief: Prof. Mehmet Sahinoglu
    • Associate Editor-in-Chief: Assoc. Prof. Alberto Arteta
    • Executive Editor: Ms. Mia Hu
    • Abstracting/Indexing: Scopus (Since 2022), INSPEC (IET), CNKI,  Google Scholar, EBSCO, etc.
    • E-mail: ijcte@iacsitp.com
    • Journal Metrics:

Prof. Mehmet Sahinoglu
Computer Science Department, Troy University, USA
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.

IJCTE 2013 Vol.5(6): 873-876 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2013.V5.814

An Improved Group-EDF: A Real-Time Disk Scheduling Algorithm

S. Y. Amdani and M. S. Ali

Abstract—Real-time disk scheduling (RTDS) plays an important role in time-critical applications. The main idea in real time database system is that the correctness of the system depends not only on the logical results of the computations but also on the time at which the results are produced. 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. Scan-EDF work only for those transactions which are having same deadline. In 2006 g-EDF algorithm has been proposed which works after making groups for transaction having close deadlines. In groups it apply SJF algorithm. We also propose a new algorithm “FEASIBLE GROUP-EDF” that works both in under load and overload conditions as well as show better throughput than earliest mentioned algorithms. It also makes groups and applies SSTF algorithm as well as check feasibility of transaction.

Index Terms—EDF, SCAN-EDF, G-EDF, SJF, SSTF, realtime, overloaded.

S. Y. Amdani is with Department of CSE, BNCOE, Pusad, India (email: salimamdani@yahoo.com). M. S. Ali is with P. R. M. C. E. & M, Badnera, India (e-mail: softalis@gmail.com).


Cite:S. Y. Amdani and M. S. Ali, "An Improved Group-EDF: A Real-Time Disk Scheduling Algorithm," International Journal of Computer Theory and Engineering vol. 5, no. 6, pp. 873-876, 2013.

Copyright © 2008-2023. International Association of Computer Science and Information Technology. All rights reserved.