| Autor: |
Virgelio Ostria, Rey Benjamin M. Baquirin, Lance Justin Raymond Talon, Karel Cassandra Cruz, Michael Rayden Dicang |
| Rok vydání: |
2020 |
| Předmět: |
|
| Zdroj: |
ICCDE |
| DOI: |
10.1145/3379247.3379297 |
| Popis: |
The 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 functions of the Shortest Job First (SJF) and the Fittest Job First (FJF) scheduling algorithms into the SFJF scheduling algorithm while considering the arrival time algorithmic factor in a dynamic queue. The proposed approach was created in the hopes of improving the efficiency of CPU in its environments and to improve the drawbacks of the aforementioned scheduling algorithms. A comparative analysis of the SFJF was done with its algorithm predecessors in terms of average turnaround time, average waiting time, and throughput. Results show that the SFJF is capable of efficient execution when it comes to process scheduling specifically in its average waiting time as seen in different scenarios of priority scheduling. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
