ch6 review silberschatz operating system concepts essentials 2nd ed
Section 6.1
6.1 What are the two bursts that CPU schedulers are designed around? CPU-burst and IO-burst
6.2 True or False? Under preemptive scheduling, when a process switches from the running to the ready state, it may lose control of the CPU. True
Section 6.2
6.3 List at least three different criteria for designing a CPU scheduling algorithm. CPU utilisation, throughput, turnaround time, waiting time, response time
Section 6.3
6.4 What scheduling algorithm assigns the CPU to the process with the highest priority? priority scheduling
6.5 True or False? The multilevel feedback queue scheduling algorithm allows processesto migrate between different queues. True
6.6 What scheduling algorithm assigns the CPU to the process that first requested it? First-Come, First-Served
6.7 What scheduling algorithm assigns the CPU to a process for only its time slice (or time quantum?) Round-robin
6.8 What scheduling algorithm assigns the CPU to the process with the shortest burst? Shortest Job First
Section 6.4
6.9 What are the two types of contention scope for thread scheduling? Process-contention scope, System-contention scope
6.10 What are the two general hardware instructions that can be performed atomically? test_and_set(), compare_and_swap()
Chapter 6 CPU Scheduling
Section 6.5
6.11 What is more common on current systems, asymmetric or symmetric multiprocessing? symmetric multiprocessing
6.12 What are the two forms of processor affinity? soft affinity and hard affinity
6.13 What are the two general approaches for load balancing? push migration and pull migration
6.14 What are the two ways to multithread a processing core? coarse-grained and fine-grained
Section 6.6
6.15 What are the two general types of real-time scheduling? soft real-time systems and hard real-time systems
6.16 What real-time scheduling algorithm uses deadline as its scheduling criteria? Hard real-time systems
6.17 What real-time scheduling algorithm is used for scheduling periodic tasks with static priorities? rate-monotonic
Section 6.7
6.18 What is the name of the default scheduling algorithm for current Linux systems? Completely Fair Scheduler
6.19 True orFalse? A Windows threadis assigned both a priority class and a relative priority within that class. True
6.20 If a thread on a Solaris system exhausts its time quantum,will it later be assigned a higher or lower priority? lower
Section 6.8
6.21 True or False? Deterministic modeling and simulations are similar strategiesfor evaluating scheduling algorithms. True
6.1 What are the two bursts that CPU schedulers are designed around? CPU-burst and IO-burst
6.2 True or False? Under preemptive scheduling, when a process switches from the running to the ready state, it may lose control of the CPU. True
Section 6.2
6.3 List at least three different criteria for designing a CPU scheduling algorithm. CPU utilisation, throughput, turnaround time, waiting time, response time
Section 6.3
6.4 What scheduling algorithm assigns the CPU to the process with the highest priority? priority scheduling
6.5 True or False? The multilevel feedback queue scheduling algorithm allows processesto migrate between different queues. True
6.6 What scheduling algorithm assigns the CPU to the process that first requested it? First-Come, First-Served
6.7 What scheduling algorithm assigns the CPU to a process for only its time slice (or time quantum?) Round-robin
6.8 What scheduling algorithm assigns the CPU to the process with the shortest burst? Shortest Job First
Section 6.4
6.9 What are the two types of contention scope for thread scheduling? Process-contention scope, System-contention scope
6.10 What are the two general hardware instructions that can be performed atomically? test_and_set(), compare_and_swap()
Chapter 6 CPU Scheduling
Section 6.5
6.11 What is more common on current systems, asymmetric or symmetric multiprocessing? symmetric multiprocessing
6.12 What are the two forms of processor affinity? soft affinity and hard affinity
6.13 What are the two general approaches for load balancing? push migration and pull migration
6.14 What are the two ways to multithread a processing core? coarse-grained and fine-grained
Section 6.6
6.15 What are the two general types of real-time scheduling? soft real-time systems and hard real-time systems
6.16 What real-time scheduling algorithm uses deadline as its scheduling criteria? Hard real-time systems
6.17 What real-time scheduling algorithm is used for scheduling periodic tasks with static priorities? rate-monotonic
Section 6.7
6.18 What is the name of the default scheduling algorithm for current Linux systems? Completely Fair Scheduler
6.19 True orFalse? A Windows threadis assigned both a priority class and a relative priority within that class. True
6.20 If a thread on a Solaris system exhausts its time quantum,will it later be assigned a higher or lower priority? lower
Section 6.8
6.21 True or False? Deterministic modeling and simulations are similar strategiesfor evaluating scheduling algorithms. True