Assignment5

What is the numeric priority of a Windows XP thread in the NORMAL_PRIORITY_CLASS with HIGHEST relative priority? 13 10 24 8

10

In Solaris, if an interactive thread with priority 25 is waiting for I/O, what is its priority recalculated to when it is eligible to run again? 15 120 52 It remains at 25

52

What is the numeric priority of a Windows thread in the BELOW_NORMAL_PRIORITY_CLASS with NORMAL relative priority? A) 6 B) 7 C) 5 D) 8

A) 6

Which of the following scheduling algorithms must be nonpreemptive? A) SJF B) RR C) FCFS D) priority algorithms

C) FCFS

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

False

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

False

Load balancing algorithms have no impact on the benefits of processor affinity.

False

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

False

Solaris and Windows assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.

False

The length of a time quantum assigned by the Linux CFS scheduler is dependent upon the relative priority of a task

False

A multicore system allows two (or more) threads that are in compute cycles to execute at the same time

True

Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long

True

SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores.

True

The most complex scheduling algorithm is the multilevel feedback-queue algorithm.

True

In Solaris, what is the time quantum (in milliseconds) of an interactive thread with priority 35? Select one: a. 80 b. 35 c. 25 d. 54

a. 80

Which of the following can be a solution to the problem of indefinite blockage of low-priority processes? Select one: a. Aging b. Multilevel queue c. All of the above d. Starvation

a. Aging

Shortest-remaining-time-first scheduling is the preemptive version of __________? Select one: a. SJF b. RR c. FCFS d. Multilevel queue

a. SJF

Windows 7 User-mode scheduling (UMS) allows applications to create and manage thread independently of the kernel Select one: a. True b. False

a. True

Assume process P0 and P1 are the process before and after a context switch, and PCB0 and PCB1 are respectively their process control block. Which of the following time units are included inside the dispatch latency? Select one: a. save state into PCB0, and restore state from PCB1 b. P0 executing c. all of the other answers d. P1 executing

a. save state into PCB0, and restore state from PCB1

For interactive systems, it is more important to minimize ________. Select one: a. the variance in response time b. the average response time c. the average turnaround time d. the waiting time

a. the variance in response time

A Solaris interactive thread with a time quantum of 80 has a higher priority than an interactive thread with a time quantum of 120. Select one: a. False b. True

b. True

In the Linux CFS scheduler, the task with smallest value of vruntime is considered to have the highest priority. Select one: a. False b. True

b. True

The Completely Fair Scheduler (CFS) is the default scheduler for Linux systems. Select one: a. False b. True

b. True

The ready queue can be implemented as a _______________. Select one: a. unordered linked list b. all of the above c. priority queue d. tree e. FIFO queue

b. all of the above

Which of the following circumstances can cooperative scheduling take place? Select one: a. none of the other answers b. when a process switches from the running state to the waiting state c. when a process switches from the waiting state to the ready state d. when a process switches from the running state to the ready state

b. when a process switches from the running state to the waiting state

I/O-bound program typically has many short ______ and a CPU-bound program might have a few long __________. Select one: a. I/O burst, I/O burst b. CPU burst, I/O burst c. CPU burst, CPU burst d. I/O burst, CPU burst

c. CPU burst, CPU burst

If the time quantum gets too large, RR scheduling degenerates to __________? Select one: a. Shortest-remaining-time-first b. Multilevel queue c. FCFS d. SJF

c. FCFS

Which of the following scheduling algorithm may suffer from convoy effect? Select one: a. SJF b. Multilevel queue c. FCFS d. RR

c. FCFS

Which of the following scheduling algorithms gives the minimum average response time? Select one: a. FCFS b. SJF c. RR d. Multilevel queue

c. RR

Which of the following criteria is more important from the point of view of a particular process? Select one: a. Response time b. CPU utilization c. Turnaround time d. Throughput

c. Turnaround time

The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU. Select one: a. dispatch latency b. system-contention scope c. convoy effect d. waiting time

c. convoy effect

Which of the following processes usually have highest priority? Select one: a. system processes b. interactive processes c. real-time processes d. batch processes

c. real-time processes

A significant problem with priority scheduling algorithms is _____. Select one: a. determining the length of the time quantum b. complexity c. starvation d. determining the length of the next CPU burst

c. starvation

The default scheduling class for a process in Solaris is ____. Select one: a. system b. real-time c. time sharing d. interactive

c. time sharing

Which of the following circumstances can preemptive scheduling take place? Select one: a. when a process terminates b. when a process switches from the running state to the waiting state c. when a process switches from the waiting state to the ready state d. none of the other answers

c. when a process switches from the waiting state to the ready state

Which of the following criteria is more important for an interactive system? Select one: a. CPU utilization b. Turnaround time c. Throughput d. Response time

d. Response time

Which of the following scheduling algorithms gives the minimum average waiting time for a given set of processes? Select one: a. FCFS b. Multilevel queue c. RR d. SJF

d. SJF

Which of the following items does not belong to the function of a dispatcher? Select one: a. switching to user mode b. switching context from one process to another c. jumping to the proper location in the user program to resume that program d. selecting a process among the available ones in the ready queue

d. selecting a process among the available ones in the ready queue

The Linux CFS scheduler identifies _____________ as the interval of time during which every runnable task should run at least once. Select one: a. load balancing b. nice value c. virtual run time d. targeted latency

d. targeted latency

Which of the following system architectures involves multiprocessor scheduling? Select one: a. NUMA systems b. heterogeneous multiprocessing c. multicore CPUs d. multithreaded cores e. all of the above.

e. all of the above.