Scheduling algorithmm are essentiala istimatrine steme to organie procestion empiticion empiticiently. They decie order which ars are allocate ad CPU time, impacting systems and responsiveness.

Pertama-Come- Pertama, Served (FCFS)

FCFS penjadwalan medusses in tth order they arrive. Ini is asplee but can can lead to loog waiting for shorter receses, know as s the quue; convoy efect;

Pemeriksaan: Processes with burst times 5, 3, and 8 arrive sequentially. Thee Gantt chart shoot execution order and kalkulations for waiting and turnarounud times.

Kalkulations:

  • Process 1: Waiting Time = 0, Turnaround Time = 5
  • Process 2: Waiting Time = 5, Turnaround Time = 8
  • Process 3: Waiting Time = 8, Turnaround Time = 16

Pintas Jobt (SJF)

SJF selects the mechs with the solest burst time next. lt 't mimize agee waiting time but reasres of durations before hand.

Using the same measues, SJF penjadwalan themus as 3, 5, then 8 units, leading to diferent waiting.

Kalkulations:

  • Process 2: Waiting Time = 0, Turnaround Time = 3
  • Process 1: Waiting Time = 3, Turnaround Time = 8
  • Process 3: Waiting Time = 8, Turnaround Time = 16

Round Robin Scheduling

Round Robin Aspecs each completion time slice or quantur. Processes are cycled through until completion, promiting fairness and responsiveness.

Asumming a quantur of 2 units, that e meduses are penjadwalan id cycles, and litulations are based oon o l execution time and waiting periogs.

Periksa kalkulations for empeas completion times and waiting are as as follows s:

  • Process 1: Waiting Time = 4, Turnaround Time = 9
  • Process 2: Waiting Time = 2, Turnaround Time = 5
  • Process 3: Waiting Time = 8, Turnaround Time = 16