Loading presentation...

Present Remotely

Send the link below via email or IM

Copy

Present to your audience

Start remote presentation

  • Invited audience members will follow you as you navigate and present
  • People invited to a presentation do not need a Prezi account
  • This link expires 10 minutes after you close the presentation
  • A maximum of 30 users can follow your presentation
  • Learn more about this feature in our knowledge base article

Do you really want to delete this prezi?

Neither you, nor the coeditors you shared it with will be able to recover it again.

DeleteCancel

CPU Scheduling(FCFS,SJF(Preemptive & Non Preemptive)

No description

Comments (0)

Please log in to add your comment.

Report abuse

Transcript of CPU Scheduling(FCFS,SJF(Preemptive & Non Preemptive)

CPU Scheduling
CPU scheduling is a process which allows one process to use the CPU while the execution of another process is on hold(in waiting state) due to unavailability of any resource like I/O etc, thereby making full use of CPU. 
Types of Scheduling
Methods
SCHEDULING CRITERIA
PROCESS STATES
FCFS [first come first serve]
FCFS example
CPU Scheduling
(FCFS,
SJF
(Preemptive &
Non Preemptive)

Non preemptive
Preemptive

CPU Utilization
Throughput
Turnaround time
Waiting time
Response time
Fairness
The process which enters the queue first is executed first.
It is non-preemptive.
Waiting time:
Turnaround time:
Response time:
FCFS
Advantages:
Better for long processes
Simple method
No starvation
Disadvantages:
Convoy effect .
lower CPU utilization
Throughput.


MAHAMUDUL HASSAN
….(ID: 143-15-4436)…..
SJF :
SJF (Shortest-job-first)……………….


Shortest job first is a scheduling algorithm in which the process with the smallest execution time is selected for execution next

Types of SJF :
Two types of SJF :
Non- Preemptive.
Preemptive.
Non- Preemptive:
Once selected for execution , a process continues to run until the end of its     CPU burst time.

EXAMPLE:
Q. Draw the Gantt chart and find average waiting time from the given table by using SJF ?

Gantt Chart :

Average Waiting Time :


Md. Nakibul Huda
ID#143-15-4437
Shortest Job First(SJF) Preemptive
ANIKA NAWAR
….(ID: 143-15-4330)…..
NOOR KIBRIA SABUZ
….(ID: 143-15-4329)…..
Thank You
Full transcript