1.2.1.4 Scheduling Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is Scheduling?

A
  • Allocating processor time to each application to ensure processor time is used as efficiently as possible when multitasking.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What are 5 types of Scheduling?

A
  • Round Robin
  • First Come First Served
  • Multi-level Feedback Queues
  • Shortest Job First
  • Shortest Remaining Time
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is Round Robin Scheduling?

A
  • A scheduling algorithm where each process is given an equal time slice and is dealt with on a first in first out basis.
  • If a process does not finish within a time slice it joins the end of the queue
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is First Come First Served Scheduling?

A
  • A scheduling algorithm where processes are dealt with in the order they arrive :a queue
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

What are Multi-level Feedback Queues?

A
  • A scheduling algorithm that uses multiple queues, each with a different priority.
  • Jobs can be moved between queues.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

What is Shortest Job First Scheduling?

A
  • A scheduling algorithm that picks the process with shortest estimated running time and runs it until it finishes.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

What is Shortest Remaining Time Scheduling?

A
  • A scheduling algorithm that picks the process with shortest estimated time remaining to finish.
  • If a process with a shorter time is added, the scheduler switches processes.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly