[SOLVED] CS COMP 3430 Guderian

Operating Systems
COMP 3430 Guderian

Copyright By Assignmentchef assignmentchef

Scheduling
Lets start with non-preemptive schedulers

What workloads make sense
Which makes more sense?
Are there workloads that make more or less sense What kind of workloads exist?

What problems exist with
Shortest Time-to-Completion First (STCF)

What problems exist with
Shortest Time-to-Completion First (STCF) Is it fair?

What problems exist with
Shortest Time-to-Completion First (STCF)
Is it fair?
Still getting queued!

What problems exist with
Shortest Time-to-Completion First (STCF)
Is it fair?
Still getting queued!
What workloads could this make sense for?

Does Round-robin solve everything?

Does Round-robin solve everything?
Is it fair?

Does Round-robin solve everything?
Is it fair?
What kind of workloads would be appropriate?

We may have discussed this what should we do with I/O?

We may have discussed this what should we do with I/O?
Queue it somewhere else!

We may have discussed this what should we do with I/O?
Queue it somewhere else!
The READY queue should only have jobs that are ready

CS: assignmentchef QQ: 1823890830 Email: [email protected]