Renz Rallion T. Gomez
Christopher M. Bermudez
ABSTRACT
The End to End Dynamic Round Robin (E-EDRR) Scheduling Algorithm Utilizing Shortest Job First Analysis functions as a method of queuing and allocating time to tasks that the CPU will process. It is an improved Round Robin that uses Shortest Job First to compare tasks and end to end method to execute tasks. It aims to reduce these three metrics: (1) the time it takes to complete tasks, (2) the time it takes for the ready-for-processing tasks to be executed, and (3) the number of times the CPU switches between tasks. To verify these aims, test cases were conducted that showed the comparative results between E-EDRR and the original algorithms, (Round Robin and Shortest Job First). In the findings, it satisfied the expectations by getting lower scores than both of the original algorithms from all the metrics in all test cases except in one where the Round Robin's variables favor the conditions of the case. It was concluded that E-EDRR has achieved its goal and proved its theoretical acquisitions.
- A. Silberschatz, P. B. Galvin and G. Gagne 2004 Operating System Concepts John Wiley and Sons, Inc. 2005 (Yale University, Corporate Technologies, Inc., Westminster College)Google Scholar
- Mohammed Abbas Fadhil Al-Husainy 2007 Best-Job-First CPU Scheduling Algorithm (Middle East University, Amman, Jordan) DOI: 10.3923/itj.2007.289.293 Source: DOAJ Information Technology Journal-2007Google Scholar
- Pushpraj Singh, Vinod Singh and Anjani Pandey 2014 Analysis and COmparison of CPU Scheduling Algorithms IJETAE Volume 4, Issue 1, January 2014 (VITS Engineering College Satna (MP), India)Google Scholar
- Mario Jean Rene and Dimitri Kagaris 2014 Equitable Shortest Job First: A Preemptive Scheduling Algorithm for Soft Real-Time Systems OpenSIUC 2014 (Southern Illinois University Carbondale)Google Scholar
- J. R. Indusree and B. Prabadevi 2017 Enhanced round robin CPU scheduling with burst time based time quantum 14th ICSET-2017 (VIT University, Vellore, India)Google Scholar
Index Terms
- End to End Dynamic Round Robin (E-EDRR) Scheduling Algorithm Utilizing Shortest Job First Analysis
Recommendations
Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm
ICCDE '20: Proceedings of 2020 6th International Conference on Computing and Data EngineeringScheduling refers to a set of policies and mechanisms to control the order of work to be performed by a Computer system. Utilizing Dynamic Mean Quantum Time Round Robin to Optimize the Shortest Job First Scheduling Algorithm is a CPU scheduling ...
An Experimental Study on the Shortest Fittest Job First (SFJF) Scheduling Algorithm using Dynamic Queues
ICCDE '20: Proceedings of 2020 6th International Conference on Computing and Data EngineeringThe Shortest Fittest Job First (SFJF) is a propositional algorithm that implements the usage of a dynamic queue wherein the shortest and more suitable process is prioritized. The objective of this paper is to develop a new approach by combining some ...
A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time task scheduling technique
Cloud computing is a ubiquitous network access model to a shared pool of configurable computing resources where available resources must be checked and scheduled using an efficient task scheduler to be assigned to clients. Most of the existing task ...
Comments