ECE344 — Operating Systems not tested, may be useful

  • we let the algorithm manage the priorities

  • we use set time slices and measure CPU usage

  • increase the priority of processes that don’t use their time slice

  • decrease the priority of processes that use their full time slice

  • we pick the lowest number as the highest priority

  • each process gets assigned a priority when started

  • pick lowest priority # to schedule, if it yields pick next lowest number

  • break ties with arrival number

  • if a lower p# becomes ready, switch to it

  • some points missed