Fittest Job First Dynamic Round Robin (FJFDRR) scheduling algorithm using dual queue and arrival time factor: a comparison

The Fittest Job First Dynamic Round Robin (FJFDRR) was introduced as a CPU scheduling algorithm whose performance evaluation reduces the number of context switches (CS), average waiting time (AWT), and average turnaround time (ATAT) of processes in a single CPU environment. In this paper, we explore...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IOP conference series. Materials Science and Engineering Ročník 482; číslo 1; s. 12046 - 12054
Hlavní autoři: Manuel, Jezreel Ian C., Baquirin, Rey Benjamin M., Guevara, Kier Sostenes, Tandingan, Dionisio R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 11.03.2019
Témata:
Algorithms
Context
Design of experiments
Microprocessors
Performance evaluation
Queues
Response time
Scheduling
Switches
Time factors
ISSN:1757-8981, 1757-899X, 1757-899X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Fittest Job First Dynamic Round Robin (FJFDRR) was introduced as a CPU scheduling algorithm whose performance evaluation reduces the number of context switches (CS), average waiting time (AWT), and average turnaround time (ATAT) of processes in a single CPU environment. In this paper, we explored improvements on the FJFDRR by including the process arrival time as an algorithmic factor implemented using a dual queue. We then compared the performance of the proposed algorithm called enhanced Fittest Job First Dynamic Round Robin (eFJFDRR) as with the FJFDRR algorithm together with the other CPU scheduling algorithms. Trial results showed that eFJFDRR scheduling algorithm performed better in reducing average waiting time, average turnaround time, and average response time in some cases. It was also found to balance the number of context switches of the processor during execution.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1757-8981
1757-899X
1757-899X
DOI:10.1088/1757-899X/482/1/012046