Quiz
Scheduling Quiz
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (35)
1 Which of the following is true of cooperative scheduling?
- AIt requires a timer
- BA process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state
- CIt incurs a cost associated with access to shared data
- DA process switches from the running state to the ready state when an interrupt occurs
2 ____ is the number of processes that are completed per time unit.
- ACPU Utilization
- BResponse Time
- CTurnaround Time
- DThroughput
3 ____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.
- ASJF
- BMultilevel queue
- CFCFS
- DRR
4 The ____ scheduling algorithm is designed especially for time-sharing systems.
- AMultilevel queue
- BFCFS
- CSJF
- DRR
5 Which of the following is true of multilevel queue scheduling?
- AProcesses can move between queues.
- BEach queue has its own scheduling algorithm.
- CA queue cannot have absolute priority over lower-priority queues.
- DIt is the most general CPU-scheduling algorithm.
6 Which of the following scheduling algorithms can be nonpreemptive?
- ASJF
- BRR
- CFCFS
- DPriority Algorithms
7 In Little's formula, λ, represents the ____.
- Aaverage waiting time in the queue
- Baverage arrival rate for new processes in the queue
- Caverage queue length
- Daverage CPU utilization
8 ______ allows a thread to run on only one processor.
- ANUMA
- BProcessor affinity
- CProcessor set
- DLoad balancing
9__________ involves the decision of which kernel thread to schedule onto which CPU.
- AProcess-contention scope
- BSystem-contention scope
- CDispatcher
- DRound-robin scheduling
10With _______ a thread executes on a processor until a long-latency event (i.e. a memory stall) occurs.
- Avirtualization
- Bcoarse-grained multithreading
- Cfine-grained multithreading
- Dmulticore processors
11A significant problem with priority scheduling algorithms is _____.
- Adetermining the length of the next CPU burst
- Bdetermining the length of the time quantum
- Ccomplexity
- Dstarvation
12The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.
- Asystem-contention scope
- Bdispatch latency
- Cwaiting time
- Dconvoy effect
13The rate of a periodic task in a hard real-time system is ____, where pis a period and tis the processing time.
- A1/p
- Bpt
- C1/t
- Dp/t
14Which of the following is true of the rate-monotonic scheduling algorithm?
- AThe task with the shortest period will have the lowest priority
- BIt uses a dynamic priority policy
- CCPU utilization is bounded when using this algorithm
- DIt is non-preemptive.
15 Which of the following is true of earliest-deadline-first (EDF) scheduling algorithm?
- AIt assigns priorities statically according to deadline.
- BPriorities are fixed; that is, they cannot be adjusted when a new process starts running.
- CDeadlines are assigned as following: the earlier the deadline, the lower the priority; the later the deadline, the higher the priority.
- DWhen a process becomes runnable, it must announce its deadline requirements to the system.
16The two general approaches to load balancing are __________ and ____________.
- Asoft affinity, hard affinity
- Bcoarse grained, fine grained
- Csoft real-time, hard real-time
- Dpush migration, pull migration
17 In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use.
- ATrue
- BFalse
18In RR scheduling, the time quantum should be small with respect to the context-switch time.
- ATrue
- BFalse
19The most complex scheduling algorithm is the multilevel feedback-queue algorithm.
- ATrue
- BFalse
20 Load balancing is typically only necessary on systems with a common run queue.
- ATrue
- BFalse
21Systems using a one-to-one model (such as Windows, Solaris , and Linux) schedule threads using process-contention scope (PCS).
- ATrue
- BFalse
22Solaris and Windows assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.
- ATrue
- BFalse
23A Solaris interactive thread with priority 15 has a higher relative priority than an interactive thread with priority 20
- ATrue
- BFalse
24A Solaris interactive thread with a time quantum of 80 has a higher priority than an interactive thread with a time quantum of 120.
- ATrue
- BFalse
25SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores.
- ATrue
- BFalse
26Windows 7 User-mode scheduling (UMS) allows applications to create and manage thread independently of the kernel
- ATrue
- BFalse
27Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.
- ATrue
- BFalse
28Load balancing algorithms have no impact on the benefits of processor affinity.
- ATrue
- BFalse
29A multicore system allows two (or more) threads that are in compute cycles to execute at the same time.
- ATrue
- BFalse
30 Providing a preemptive, priority-based scheduler guarantees hard real-time functionality.
- ATrue
- BFalse
31 In hard real-time systems, interrupt latency must be bounded.
- ATrue
- BFalse
32In Pthread real-time scheduling, the SCHED_FIFO class provides time slicing among threads of equal priority.
- ATrue
- BFalse
33In the Linux CFS scheduler, the task with smallest value of vruntimeis considered to have the highest priority.
- ATrue
- BFalse
34The length of a time quantum assigned by the Linux CFS scheduler is dependent upon the relative priority of a task.
- ATrue
- BFalse
35The Completely Fair Scheduler (CFS) is the default scheduler for Linux systems.
- ATrue
- BFalse
Information
- Description
- Quiz on Scheduling Quiz, created by M KB on 21/10/2018.
- Author
- M KB
- Language
- English
- Views
- 0
- Tags
- Rating
- No ratings yet Rate this quiz