2009 · 30 citations · 0 references
ComputingComputer ScienceComputer SystemsAlgorithmsComputer ArchitectureSchedulingAlgorithm AnalysisCpu SchedulingPerformance OptimizationResource SchedulingScheduling TheoryTask SchedulingAverage Utilization AnalysisPriority SchedulingProcess Waiting TimeScheduling AlgorithmsScheduling In Multiprocessor SystemsShortest Job First SchedulingThroughputThroughput-aware Scheduling
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 av erage throughput) to determine which algorithm is most suitable for which objective. Experimental results were provided.