WGU C191 Chapter 6 - CPU Scheduling questions
with verified answers
5 Priorities in a multilevel queue Ans✓✓✓-1. System processes.
2. Interactive processes
3. Interactive editing processes
4. Batch processes
5. Student processes.
Admission Control Algorithm Ans✓✓✓-A process may have to announce its
deadline to the scheduler. The scheduler then either admits the process if it can
complete its task by the deadline, or rejects the request as impossible if it cannot
guarantee that the task will be serviced by its deadline.
Aging Ans✓✓✓-A solution to the problem of indefinite blocking or starvation.
The longer a process stays in the ready queue, the more it 'ages' by increasing
priority. Eventually, this low priority process will age to be a high priority process,
where it will be executed.
Analytic Evaluation Ans✓✓✓-Uses the given algorithm and the system workload
to produce a formula or number to evaluate the performance of that algorithm
for that workload.
Asymmetric multiprocessing Ans✓✓✓-All scheduling decisions, I/O processing,
and other system activities are handled by a single processor--a master server.
The other processors only execute user code.
, Much more simple, because only one processor accesses the system data
structures, reducing the need for data sharing.
Background process Ans✓✓✓-A process that runs "behind the scenes" with a low
priority, does not require input, and rarely creates output. A batch process.
Base priority values for Windows priority classes: Ans✓✓✓-1. Idle: 4
2. Below Normal: 6
3. Normal: 8
4. Above Normal: 10
5. High Priority: 13
6. Real-Time: 24
Completely Fair Scheduler Ans✓✓✓-CFS. Linux implemented this scheduler as
the default scheduler in 2.6.
CONVOY EFFECT Ans✓✓✓-Occurs in First Come, First Serve scheduling. When a
long process is executed, several short processes may be forced to trail this long
process.
CPU Scheduling algorithm criteria: Ans✓✓✓-1. CPU utilization: The CPU should
be as busy as possible (40-90% load, generally speaking)
2. Throughput:
3. Turnaround Time (TT)
4. Waiting Time (WT)
5. Response Time (RT)
with verified answers
5 Priorities in a multilevel queue Ans✓✓✓-1. System processes.
2. Interactive processes
3. Interactive editing processes
4. Batch processes
5. Student processes.
Admission Control Algorithm Ans✓✓✓-A process may have to announce its
deadline to the scheduler. The scheduler then either admits the process if it can
complete its task by the deadline, or rejects the request as impossible if it cannot
guarantee that the task will be serviced by its deadline.
Aging Ans✓✓✓-A solution to the problem of indefinite blocking or starvation.
The longer a process stays in the ready queue, the more it 'ages' by increasing
priority. Eventually, this low priority process will age to be a high priority process,
where it will be executed.
Analytic Evaluation Ans✓✓✓-Uses the given algorithm and the system workload
to produce a formula or number to evaluate the performance of that algorithm
for that workload.
Asymmetric multiprocessing Ans✓✓✓-All scheduling decisions, I/O processing,
and other system activities are handled by a single processor--a master server.
The other processors only execute user code.
, Much more simple, because only one processor accesses the system data
structures, reducing the need for data sharing.
Background process Ans✓✓✓-A process that runs "behind the scenes" with a low
priority, does not require input, and rarely creates output. A batch process.
Base priority values for Windows priority classes: Ans✓✓✓-1. Idle: 4
2. Below Normal: 6
3. Normal: 8
4. Above Normal: 10
5. High Priority: 13
6. Real-Time: 24
Completely Fair Scheduler Ans✓✓✓-CFS. Linux implemented this scheduler as
the default scheduler in 2.6.
CONVOY EFFECT Ans✓✓✓-Occurs in First Come, First Serve scheduling. When a
long process is executed, several short processes may be forced to trail this long
process.
CPU Scheduling algorithm criteria: Ans✓✓✓-1. CPU utilization: The CPU should
be as busy as possible (40-90% load, generally speaking)
2. Throughput:
3. Turnaround Time (TT)
4. Waiting Time (WT)
5. Response Time (RT)
