Question 1

Distinguish between coarse-grained and fine-grained multithreading.

Accepted Answer

Unlike the rate-monotonic algorithm, EDF

Question 2

What is the numeric priority of a Windows thread in the NORMAL_PRIORITY_CLASS with HIGHEST relative priority?

Accepted Answer

A)  24 
B)  10 
C)  8 
D)  13 
A)  24 
B)  10 
C)  8 
D)  13

Question 3

Load balancing is typically only necessary on systems with a common run queue.

Accepted Answer

A) True 
 B)False

Question 4

Which of the following items does not belong to the function of a dispatcher?

Accepted Answer

A)  switching context from one process to another 
B)  selecting a process among the available ones in the ready queue 
C)  switching to user mode 
D)  jumping to the proper location in the user program to resume that program 
A)  switching context from one process to another 
B)  selecting a process among the available ones in the ready queue 
C)  switching to user mode 
D)  jumping to the proper location in the user program to resume that program

Question 5

Explain the fundamental difference between asymmetric and symmetric multiprocessing.

Accepted Answer

In asymmetric multiprocessing,

Question 6

Which of the following can be a solution to the problem of indefinite blockage of low-priority processes?

Accepted Answer

A)  Aging 
B)  Starvation 
C)  Multilevel queue 
D)  All of the above 
A)  Aging 
B)  Starvation 
C)  Multilevel queue 
D)  All of the above

Question 7

In RR scheduling, the time quantum should be small with respect to the context-switch time.

Accepted Answer

A) True 
 B)False

Question 8

Which of the following POSIX API sets the scheduling policy?

Accepted Answer

A)  pthread_attr_getsched_policy 
B)  pthread_attr_setsched_policy 
C)  pthread_attr_getscope 
D)  pthread_attr_setscope 
A)  pthread_attr_getsched_policy 
B)  pthread_attr_setsched_policy 
C)  pthread_attr_getscope 
D)  pthread_attr_setscope

Question 9

In the Linux CFS scheduler, the task with smallest value of vruntime is considered to have the highest priority.

Accepted Answer

A) True 
 B)False

Question 10

Which of the following circumstances can preemptive scheduling take place?

Accepted Answer

A)  when a process switches from the running state to the waiting state 
B)  when a process switches from the waiting state to the ready state 
C)  when a process terminates 
D)  none of the above 
A)  when a process switches from the running state to the waiting state 
B)  when a process switches from the waiting state to the ready state 
C)  when a process terminates 
D)  none of the above

Question 11

A Solaris interactive thread with priority 15 has a higher relative priority than an interactive thread with priority 20

Accepted Answer

A) True 
 B)False

Question 12

A Solaris interactive thread with a time quantum of 80 has a higher priority than an interactive thread with a time quantum of 120.

Accepted Answer

A) True 
 B)False

Question 13

What effect does the size of the time quantum have on the performance of an RR algorithm?

Accepted Answer

At one extreme, if the time quantum is e

Question 14

What role does the dispatcher play in CPU scheduling?

Accepted Answer

The dispatcher gives control of the CPU

Question 15

Describe two general approaches to load balancing.

Accepted Answer

With push migration, a specific task per

Question 16

If the time quantum get too large, RR scheduling degenerates to __________?

Accepted Answer

A)  SJF 
B)  FCFS 
C)  Shortest-remaining-time-first 
D)  Multilevel queue 
A)  SJF 
B)  FCFS 
C)  Shortest-remaining-time-first 
D)  Multilevel queue

Question 17

The Linux CFS scheduler identifies _____________ as the interval of time during which every runnable task should run at least once.

Accepted Answer

A)  virtual run time 
B)  targeted latency 
C)  nice value 
D)  load balancing 
A)  virtual run time 
B)  targeted latency 
C)  nice value 
D)  load balancing

Distinguish between coarse-grained and fine-grained multithreading.

What is the numeric priority of a Windows thread in the NORMAL_PRIORITY_CLASS with HIGHEST relative priority?

Load balancing is typically only necessary on systems with a common run queue.

Which of the following items does not belong to the function of a dispatcher?

Explain the fundamental difference between asymmetric and symmetric multiprocessing.

Which of the following can be a solution to the problem of indefinite blockage of low-priority processes?

In RR scheduling, the time quantum should be small with respect to the context-switch time.

Which of the following POSIX API sets the scheduling policy?

In the Linux CFS scheduler, the task with smallest value of vruntime is considered to have the highest priority.

Which of the following circumstances can preemptive scheduling take place?

A Solaris interactive thread with priority 15 has a higher relative priority than an interactive thread with priority 20

A Solaris interactive thread with a time quantum of 80 has a higher priority than an interactive thread with a time quantum of 120.

What effect does the size of the time quantum have on the performance of an RR algorithm?

What role does the dispatcher play in CPU scheduling?

Describe two general approaches to load balancing.

If the time quantum get too large, RR scheduling degenerates to __________?

The Linux CFS scheduler identifies _____________ as the interval of time during which every runnable task should run at least once.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters

Exam 5: Cpu Scheduling

Distinguish between coarse-grained and fine-grained multithreading.

What is the numeric priority of a Windows thread in the NORMAL_PRIORITY_CLASS with HIGHEST relative priority?

Load balancing is typically only necessary on systems with a common run queue.

Which of the following items does not belong to the function of a dispatcher?

Explain the fundamental difference between asymmetric and symmetric multiprocessing.

Which of the following can be a solution to the problem of indefinite blockage of low-priority processes?

In RR scheduling, the time quantum should be small with respect to the context-switch time.

Which of the following POSIX API sets the scheduling policy?

In the Linux CFS scheduler, the task with smallest value of vruntime is considered to have the highest priority.

Which of the following circumstances can preemptive scheduling take place?

A Solaris interactive thread with priority 15 has a higher relative priority than an interactive thread with priority 20

A Solaris interactive thread with a time quantum of 80 has a higher priority than an interactive thread with a time quantum of 120.

What effect does the size of the time quantum have on the performance of an RR algorithm?

What role does the dispatcher play in CPU scheduling?

Describe two general approaches to load balancing.

If the time quantum get too large, RR scheduling degenerates to __________?

The Linux CFS scheduler identifies _____________ as the interval of time during which every runnable task should run at least once.

Introduction

Operating-System Structures

Processes

Threads Concurrency

Synchronization Tools

Synchronization Examples

Deadlocks

Main Memory

Virtual Memory

Mass-Storage Structure

Io Systems

File-System Interface

File-System Implementation

File-System Internals

Security

Protection

Filters