SchedulingJonathan GeislerFebruary 22, 2006Jonathan Geisler SchedulingWhen does the scheduler run?Process exits run stateTerminatesMoves to wait stateMoves to ready stateProcess enters ready stateMoves from wait stateCreatedJonathan Geisler SchedulingWhen does the scheduler run?Process exits run stateTerminatesMoves to wait stateMoves to ready stateProcess enters ready stateMoves from wait stateCreatedJonathan Geisler SchedulingWhen does the scheduler run?Process exits run stateTerminatesMoves to wait stateMoves to ready stateProcess enters ready stateMoves from wait stateCreatedJonathan Geisler SchedulingWhen does the scheduler run?Process exits run stateTerminatesMoves to wait stateMoves to ready stateProcess enters ready stateMoves from wait stateCreatedJonathan Geisler SchedulingWhen does the scheduler run?Process exits run stateTerminatesMoves to wait stateMoves to ready stateProcess enters ready stateMoves from wait stateCreatedJonathan Geisler SchedulingWhen does the scheduler run?Process exits run stateTerminatesMoves to wait stateMoves to ready stateProcess enters ready stateMoves from wait stateCreatedJonathan Geisler SchedulingWhen does the scheduler run?Process exits run stateTerminatesMoves to wait stateMoves to ready stateProcess enters ready stateMoves from wait stateCreatedJonathan Geisler SchedulingEvaluating scheduling algorithmsCPU Utilization: keeping CPU busyThroughput: finishing many jobsTurnaround: pleasing the usersWaiting: minimizing ready queueResponse: let the user start workingJonathan Geisler SchedulingEvaluating scheduling algorithmsCPU Utilization: keeping CPU busyThroughput: finishing many jobsTurnaround: pleasing the usersWaiting: minimizing ready queueResponse: let the user start workingJonathan Geisler SchedulingEvaluating scheduling algorithmsCPU Utilization: keeping CPU busyThroughput: finishing many jobsTurnaround: pleasing the usersWaiting: minimizing ready queueResponse: let the user start workingJonathan Geisler SchedulingEvaluating scheduling algorithmsCPU Utilization: keeping CPU busyThroughput: finishing many jobsTurnaround: pleasing the usersWaiting: minimizing ready queueResponse: let the user start workingJonathan Geisler SchedulingEvaluating scheduling algorithmsCPU Utilization: keeping CPU busyThroughput: finishing many jobsTurnaround: pleasing the usersWaiting: minimizing ready queueResponse: let the user start workingJonathan Geisler SchedulingIssues to think aboutConvoy effectTo preempt or not to preempt . . .StarvationSMPLoad balanacingProcessor affinitySMT vs. SMPJonathan Geisler SchedulingIssues to think aboutConvoy effectTo preempt or not to preempt . . .StarvationSMPLoad balanacingProcessor affinitySMT vs. SMPJonathan Geisler SchedulingIssues to think aboutConvoy effectTo preempt or not to preempt . . .StarvationSMPLoad balanacingProcessor affinitySMT vs. SMPJonathan Geisler SchedulingIssues to think aboutConvoy effectTo preempt or not to preempt . . .StarvationSMPLoad balanacingProcessor affinitySMT vs. SMPJonathan Geisler SchedulingIssues to think aboutConvoy effectTo preempt or not to preempt . . .StarvationSMPLoad balanacingProcessor affinitySMT vs. SMPJonathan Geisler SchedulingIssues to think aboutConvoy effectTo preempt or not to preempt . . .StarvationSMPLoad balanacingProcessor affinitySMT vs. SMPJonathan Geisler SchedulingIssues to think aboutConvoy effectTo preempt or not to preempt . . .StarvationSMPLoad balanacingProcessor affinitySMT vs. SMPJonathan Geisler