Performance Assessment of Some CPU Scheduling Algorithms

Free registration required

Executive Summary

The problem of scheduling which computer process run at what time on the Central Processing Unit (CPU) or the processor is explored. Three basic CPU scheduling algorithms (namely first come first serve, priority scheduling and shortest job first) were discussed and evaluated on four CPU scheduling objectives or goals (average waiting time, average turnaround time, average CPU utilization and average throughput) to determine which algorithm is most suitable for which objective. Experimental results were provided.

  • Format: PDF
  • Size: 83.42 KB