Scheduling Quiz

1. 1 Which of the following is true of cooperative scheduling?

   1. AIt requires a timer
   2. BA process keeps the CPU until it releases the CPU either by terminating or by switching to the waiting state
   3. CIt incurs a cost associated with access to shared data
   4. DA process switches from the running state to the ready state when an interrupt occurs
2. 2 ____ is the number of processes that are completed per time unit.

   1. ACPU Utilization
   2. BResponse Time
   3. CTurnaround Time
   4. DThroughput
3. 3 ____ scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.

   1. ASJF
   2. BMultilevel queue
   3. CFCFS
   4. DRR
4. 4 The ____ scheduling algorithm is designed especially for time-sharing systems.

   1. AMultilevel queue
   2. BFCFS
   3. CSJF
   4. DRR
5. 5 Which of the following is true of multilevel queue scheduling?

   1. AProcesses can move between queues.
   2. BEach queue has its own scheduling algorithm.
   3. CA queue cannot have absolute priority over lower-priority queues.
   4. DIt is the most general CPU-scheduling algorithm.
6. 6 Which of the following scheduling algorithms can be nonpreemptive?

   1. ASJF
   2. BRR
   3. CFCFS
   4. DPriority Algorithms
7. 7 In Little's formula, λ, represents the ____.

   1. Aaverage waiting time in the queue
   2. Baverage arrival rate for new processes in the queue
   3. Caverage queue length
   4. Daverage CPU utilization
8. 8 ______ allows a thread to run on only one processor.

   1. ANUMA
   2. BProcessor affinity
   3. CProcessor set
   4. DLoad balancing
9. 9__________ involves the decision of which kernel thread to schedule onto which CPU.

   1. AProcess-contention scope
   2. BSystem-contention scope
   3. CDispatcher
   4. DRound-robin scheduling
10. 10With _______ a thread executes on a processor until a long-latency event (i.e. a memory stall) occurs.

    1. Avirtualization
    2. Bcoarse-grained multithreading
    3. Cfine-grained multithreading
    4. Dmulticore processors

11. 11A significant problem with priority scheduling algorithms is _____.

    1. Adetermining the length of the next CPU burst
    2. Bdetermining the length of the time quantum
    3. Ccomplexity
    4. Dstarvation
12. 12The ______ occurs in first-come-first-served scheduling when a process with a long CPU burst occupies the CPU.

    1. Asystem-contention scope
    2. Bdispatch latency
    3. Cwaiting time
    4. Dconvoy effect
13. 13The rate of a periodic task in a hard real-time system is ____, where pis a period and tis the processing time.

    1. A1/p
    2. Bpt
    3. C1/t
    4. Dp/t
14. 14Which of the following is true of the rate-monotonic scheduling algorithm?

    1. AThe task with the shortest period will have the lowest priority
    2. BIt uses a dynamic priority policy
    3. CCPU utilization is bounded when using this algorithm
    4. DIt is non-preemptive.
15. 15 Which of the following is true of earliest-deadline-first (EDF) scheduling algorithm?

    1. AIt assigns priorities statically according to deadline.
    2. BPriorities are fixed; that is, they cannot be adjusted when a new process starts running.
    3. CDeadlines are assigned as following: the earlier the deadline, the lower the priority; the later the deadline, the higher the priority.
    4. DWhen a process becomes runnable, it must announce its deadline requirements to the system.
16. 16The two general approaches to load balancing are __________ and ____________.

    1. Asoft affinity, hard affinity
    2. Bcoarse grained, fine grained
    3. Csoft real-time, hard real-time
    4. Dpush migration, pull migration
17. 17 In preemptive scheduling, the sections of code affected by interrupts must be guarded from simultaneous use.

    1. ARichtig
    2. BFalsch
18. 18In RR scheduling, the time quantum should be small with respect to the context-switch time.

    1. ARichtig
    2. BFalsch
19. 19The most complex scheduling algorithm is the multilevel feedback-queue algorithm.

    1. ARichtig
    2. BFalsch
20. 20 Load balancing is typically only necessary on systems with a common run queue.

    1. ARichtig
    2. BFalsch
21. 21Systems using a one-to-one model (such as Windows, Solaris , and Linux) schedule threads using process-contention scope (PCS).

    1. ARichtig
    2. BFalsch
22. 22Solaris and Windows assign higher-priority threads/tasks longer time quantums and lower-priority tasks shorter time quantums.

    1. ARichtig
    2. BFalsch
23. 23A Solaris interactive thread with priority 15 has a higher relative priority than an interactive thread with priority 20

    1. ARichtig
    2. BFalsch
24. 24A Solaris interactive thread with a time quantum of 80 has a higher priority than an interactive thread with a time quantum of 120.

    1. ARichtig
    2. BFalsch
25. 25SMP systems that use multicore processors typically run faster than SMP systems that place each processor on separate cores.

    1. ARichtig
    2. BFalsch
26. 26Windows 7 User-mode scheduling (UMS) allows applications to create and manage thread independently of the kernel

    1. ARichtig
    2. BFalsch
27. 27Round-robin (RR) scheduling degenerates to first-come-first-served (FCFS) scheduling if the time quantum is too long.

    1. ARichtig
    2. BFalsch
28. 28Load balancing algorithms have no impact on the benefits of processor affinity.

    1. ARichtig
    2. BFalsch
29. 29A multicore system allows two (or more) threads that are in compute cycles to execute at the same time.

    1. ARichtig
    2. BFalsch
30. 30 Providing a preemptive, priority-based scheduler guarantees hard real-time functionality.

    1. ARichtig
    2. BFalsch
31. 31 In hard real-time systems, interrupt latency must be bounded.

    1. ARichtig
    2. BFalsch
32. 32In Pthread real-time scheduling, the SCHED_FIFO class provides time slicing among threads of equal priority.

    1. ARichtig
    2. BFalsch
33. 33In the Linux CFS scheduler, the task with smallest value of vruntimeis considered to have the highest priority.

    1. ARichtig
    2. BFalsch
34. 34The length of a time quantum assigned by the Linux CFS scheduler is dependent upon the relative priority of a task.

    1. ARichtig
    2. BFalsch
35. 35The Completely Fair Scheduler (CFS) is the default scheduler for Linux systems.

    1. ARichtig
    2. BFalsch

Beschreibung

Quiz am Scheduling Quiz, erstellt von M KB am 21/10/2018.

Autor

M KB

Sprache

English

Aufrufe

0

Schlagwörter

os

Bewertung

Noch keine Bewertungen

Bewerte dieses Quiz

Bewerte dieses Quiz

Mehr zu CPU Scheduling