Scheduling

Question 1

Scheduling

Answer 1

A system where all processes with any priority get a fair amount of processing time

Question 2

Pre-emptive scheduling

Answer 2

Where jobs are temporarily stopped and resumed another time. Like:
* Multi-level feedback queues
* Shortest remaining time
* Round robin

Question 3

Non pre-emptive scheduling

Answer 3

Once a job has started, no other jobs are started until it is complete. Like:
* First come first serve
* Shortest job first

Question 4

Multi-level feedback queues

Answer 4

Makes multiple queues, ordered in priorities where the CPU can switch between the queues.
* pro - considers all priorities
* con - difficult to implement

Question 5

Shortest time remaining

Answer 5

A queue is ordered for jobs with the least time to complete, those being serviced first
* pro - efficient as jobs are getting done quickly
* con - priority isnt considered

Question 6

Round robin

Answer 6

Each job is given a section of processor time (a time slice) which it is given for a job to be completed.
* pro - All jobs will be attended to
* con - priority isnt considered

Question 7

First come first serve

Answer 7

Jobs are served in order in which they arrived into the queue
* pro - easy to implement
* con - priorities are not considered

Question 8

Shortest job first

Answer 8

A queue that is ordered in the time required to service the job, longest at the end.
* pro - waiting time is reduced for smaller jobs
* con - processor starvation, small jobs may keep on coming in