Please enable JavaScript.

Coggle requires JavaScript to display documents.

Process Scheduling (Scheduling Algorithm (Shortest Job First Scheduling…

- - - - CPU burst>time quantum
      - CPU burst<time quantum
        
        job finished
        
        interrupted by i/o request
      - Quantum
        
        large-reduces FCFS
        
        small-context switching occurs -job execution slows down
  - - - number & type of peripheral devices
      - total cpu time
      - Memory requirement
    - - Starvation
    - - aging
  - - - backgorund(FCFS)
      - foreground(RR)
      - serve all foreground then background-can cause starvation
    - - movement jobs between queue
        
        quantum interrupt
      - variable time quantum per queue
        
        fast turnaround for CPU-bound jobs
        
        each queue given time quantum size(size twice as preivous q)
      - not allowing movement between queues
        
        high priority jobs are fcfs n low priority are allocated only when queue is empty
      - aging-gv special treatment to those waiting
      - multilevel queue
        
        job that doesn't end in quantum time it moves to different queue