Modified Round Robin algorithm (MRR)

CPU Scheduling Algorithms form the basic and fundamental concepts of Operating Systems. A scheduling algorithm is used to produce effective switches between the processes present in the ready queue. Round Robin algorithm is one among the many CPU scheduling algorithms where every process executes fo...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI) s. 2832 - 2839
Hlavní autori: Singh, Montek, Agrawal, Rohit
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2017
Predmet:
Arithmetic Mean
Arrival queue (AQ)
Context switching (CS)
CPU scheduling
Execution Time (ET)
First Come First Serve (FCFS) scheduling
Harmonic Mean
Median
Priority Scheduling
Ready queue (RQ)
Response time (RT)
Round Robin (RR) CPU scheduling algorithm
Shortest Job Remaining (SJR)
Turnaround time (TAT)
Waiting queue (WQ)
Waiting time (WT)
ISBN:9781538608135, 1538608138
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:CPU Scheduling Algorithms form the basic and fundamental concepts of Operating Systems. A scheduling algorithm is used to produce effective switches between the processes present in the ready queue. Round Robin algorithm is one among the many CPU scheduling algorithms where every process executes for a given time quantum (TQ). Therefore the system efficiency and performance are completely dependent on the value of TQ. If this value is static in nature, then the CPU performance decreases. This paper uses the dynamic TQ to create an efficient Round Robin Algorithm. This goal was achieved by using the concept of median. The traditional RR algorithm does not take priority under the consideration, which further reduces the CPU performance. The proposed algorithm improves the efficiency of the traditional RR algorithm by considering all the factors like priority, burst time and arrival time of the processes to arrange them in the ready queue and generating TQ accordingly; which effectively reduces the Waiting time, Turn-around time, and the number of context switches. The paper also presents a detailed comparison between the proposed algorithm and existing algorithms.
ISBN:9781538608135
1538608138
DOI:10.1109/ICPCSI.2017.8392238