Scribd
Upload
47 views8 pages

Round Robin vs. Priority Scheduling

The document discusses two CPU scheduling algorithms: Priority Scheduling and Round Robin Scheduling. Priority Scheduling allocates CPU resources based on assigned priority values, with higher priority tasks preempting lower ones, while Round Robin Scheduling uses time slots for each task, ensuring equitable time-sharing. Each algorithm has its advantages and disadvantages, including issues like starvation in Priority Scheduling and simplicity in Round Robin.

Uploaded by

yashwanthindiak
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views8 pages

Round Robin vs. Priority Scheduling

The document discusses two CPU scheduling algorithms: Priority Scheduling and Round Robin Scheduling. Priority Scheduling allocates CPU resources based on assigned priority values, with higher priority tasks preempting lower ones, while Round Robin Scheduling uses time slots for each task, ensuring equitable time-sharing. Each algorithm has its advantages and disadvantages, including issues like starvation in Priority Scheduling and simplicity in Round Robin.

Uploaded by

yashwanthindiak
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

PRIORITY AND ROUND ROBIN

ALGORITHM
PRESENTED BY :-
HARSHAVARDHINI (23D41A6695)
SRAVANI (23D41A6693)
CPU SCHEDULING
DIFFEREENT CPU SCHEDULING ALGORITHMS HAVE DIFFERENT PROPERTIES AND THE PROPERTIES ARE BASED ON THE
VARIOUS FACTORS.
TYPES OF CPU SCHEDULING ALGORITHMS:-
1. FIRST COME FIRST SERVE (FCFS)
2. SHORTEST JOB FIRST (SJF)
3. PRIORITY SCHEDULING
4. ROUND ROBIN SCHEDULING
5. MULTI-LEVEL QUEUE SCHEDULING
6. MULTI-LEVEL FEEDBACK QUEUE SCHEDULING
PRIORITY CPU SCHEDULING:-
THIS IS ANOTHER TYPE OF CPU SCHEDULING ALGORITHM . IN THIS CPU SCHEDULING ALGORITHM WE ARE GOING TO LEARN
HOW CPU IS GOING TO ALLOT RESOURCES TO A CERTAIN PROCESS. THE PRIORITY CPU SCHEDULING IS DIFFERENT FROM
REMAINING CPU SCHEDULING ALGORITHM. EACH AND EVERY PROCESS HAS A PRIORITY NUMBER.
THERE ARE TWO TYPES OF PRIORITY VALUES .
1. HIGHEST NUMBER IS CONSIDERED AS HIGHEST PRIORITY VALUE.
2. LOWEST NUMBER IS CONSIDERED AS LOWEST PRIORITY VALUE

CHARACTERISTICS :-
IN PRIORITY SCHEDULING ALGORITHM TASKS ARE ORGANISED ACCORDING TO THEIR IMPORTANCE.
WHEN A TASK WITH LOWER PRIORITY IS BEEN PERFORMED WHILE A TASK WITH A HIGHER PRIORITY ARRIVES, THE TASK WITH
THE LOWER PRIORITY IS REPLACED BY THE TASK WITH THE HIGHER PRIORITY, AND THE LATTER IS STOPPED UNTIL THE
EXECUTION IS FINISHED.
ADVANTAGES :-
1. AVERAGE WAITING TIME IS LESS.
2. IT IS LESS COMPLEX
3. IT IS EASIER TO HANDLE PRIORITY SCHEDULING

DISADVANTAGES :-
1. IT HAS STARVATION PROBLEM
2. DUE TO THIS , OTHER PROCESSES SHOULD WAIT FOR A LONGER PERIOD.
EXAMPLE :-
NOW , LET'S EXPLAIN THIS PROBLEM WITH THE HELP OF AN EXAMPLE OF PRIORITY SCHEDULING :-

[Link] PROCESS_ID ARRIVAL TIME BURST TIME PRIORITY


1. P1 Q 5 5

2. P2 1 6 4

3. P3 2 2 0

4. P4 3 1 2

5. P5 4 7 1

6. P6 4 6 3

GANTT CHART:-
P1 P3 P5 P4 P6 P7

0 5 7 14 15 21 27

PRIORITY :-
ID AT BT P COMP T.A.T W.T
(CT-AT) (TAT-BT)

P1 0 5 5 5 5 0

P2 1 6 4 27 26 20

P3 2 2 0 7 5 3

P4 3 1 2 15 12 11

P5 4 7 1 14 10 3

P6 4 6 3 21 17 11
ROUND ROBIN CPU SCHEDULING :-
ROUND ROBIN IS A CPU SCHEDULING ALGORITHM, IN THIS , TASKS TAKE A SPECIFIC TIME SLOT. IT IS ALSO KNOWN AS FIRST
COME FIRST SERVE CPU SCHEDULING. IN ROUND ROBIN CPU ALGORITHM, IT MAINLY TELLS ABOUT TIME-SHARING METHOD.

CHARACTERISTICS :-
1. IT IS STRAIGHT FORWORD.
2. SIMPLE TO USE.
3. IT IS STARVATION FREE. (IT DOESN'T HAVE TO WAIT FOR THE COMPLETION OF THE FIRST PROCESS).

BENIFITS OF ROUND ROBIN :-


IN THIS EVERY PROCESS REQUIRES EQUAL AMOUNT OF TIME , HENCE ROUND ROBIN APPEARS TO BE EQUITABLE (i.e, EACH
PROCESS HAVE EQUAL TIME.)
EXAMPLE :-
PROCESS ID ARRIVAL TIME BURST TIME
P0 1 3

P1 0 5

P2 3 2

P3 4 3

P4 2 1

GANTT CHART :-
P1 P0 P4 P0 P2 P3 P1

0 1 2 3 5 7 10 14

PROCESS ID ARRIVAL TIME BURST TIME COMPLETION TIME TURN AROUND WAITING TIME
TIME

P0 1 3-2 5 4 1

P1 0 5-4 14 14 9

P2 3 2 7 4 2

P3 4 3 10 6 3

P4 2 1 3 1 0
THANK YOU ;)

You might also like