A given number of tasks T1 to TN, whose duration is known, are queued in a single processor machine. Which of the following will be best Scheduling algorithm?
- First Come First Serve(FCFS)
- Shortest Job First(SJF)
- Round Robin Scheduling
- Priority Scheduling
Answer:
Option b: Shortest Job First(SJF)
Best Scheduling algorithm means it should eliminate long waiting time of a process i.e the algorithm should give maximum throughput. So Shortest Job First eliminates the longest waiting time and helps in achieve maximum throughput.
Throughput is a measure of the number of processes that can be executed by the CPU in a given amount of time.
Throughput = Number of processes completed / Time
0 Comments