Prioritized Fair Round Robin Algorithm with Variable Time Quantum

The performance of the time sharing systems and multiprocessor systems is greatly dependent on CPU scheduling algorithms. Some of the famous algorithms are Shortest Job First (SJF), First Come First Served (FCFS), Priority Scheduling and Round Robin (RR). Round Robin is the preferable choice for tim...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2015 13th International Conference on Frontiers of Information Technology (FIT) s. 314 - 319
Hlavní autoři:	Yasin, Arfa, Faraz, Ahmed, Rehman, Saad
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.12.2015
Témata:	CPU Scheduling Algorithm for time sharing systems Improved Round Robin Algorithm Information technology Number of context switches in Round Robin algorithm Turnaround Time Waiting Time
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 performance of the time sharing systems and multiprocessor systems is greatly dependent on CPU scheduling algorithms. Some of the famous algorithms are Shortest Job First (SJF), First Come First Served (FCFS), Priority Scheduling and Round Robin (RR). Round Robin is the preferable choice for time shared systems. The main aim of this paper is to formulate a new methodology for RR algorithm that enhances the performance of the time sharing systems by reducing the waiting time, turnaround time and number of context switches. The proposed algorithm Prioritized Fair Round Robin (PFRR) with variable time quantum is a combination of SJF, Priority Scheduling, and RR with variable time quantum. The idea is to set the time quantum value according to the priority and burst times of the processes in the ready queue. The algorithm is designed for both equal priority processes and different priority processes.
DOI:	10.1109/FIT.2015.62