Global Scheduling – Real-time Systems MCQs

20 min
Score: 0
Attempted: 0/20
Subscribe

1. What is the main concept of global scheduling in real-time systems?
(A) Tasks are executed sequentially on a single CPU
(B) Tasks are assigned permanently to a single processor
(C) Tasks can be scheduled on any available processor in a multiprocessor system
(D) Tasks are scheduled only in batch mode

2. Global scheduling contrasts with partitioned scheduling in that:
(A) Only one processor is used
(B) Tasks must always run on a specific processor
(C) Tasks are not statically bound to a specific processor
(D) Tasks are executed randomly without deadlines

3. In global scheduling, task migration refers to:
(A) CPU idle exclusively
(B) Moving tasks between processors to balance load
(C) Disk batch-only migration
(D) Memory-only swapping

4. A benefit of global scheduling is:
(A) Higher processor utilization in multiprocessor systems
(B) CPU idle exclusively
(C) Disk batch-only efficiency
(D) Memory-only optimization

5. A drawback of global scheduling is:
(A) Overhead due to frequent task migration
(B) CPU idle exclusively
(C) Disk batch-only issues
(D) Memory-only limitations

6. Global EDF (Earliest Deadline First) scheduling:
(A) Ignores deadlines
(B) Assigns tasks permanently to a processor
(C) Executes tasks sequentially on one CPU
(D) Allows tasks with the earliest deadline to run on any available processor

7. Global Rate Monotonic Scheduling (RMS) uses:
(A) CPU idle exclusively
(B) Task priorities based on their period across all processors
(C) Disk batch-only priorities
(D) Memory-only execution

8. In global scheduling, utilization bound tests are generally:
(A) Memory-only tests
(B) CPU idle exclusively
(C) Disk batch-only based
(D) More complex due to task migration and shared processors

9. Global scheduling is particularly useful when:
(A) Memory-only operations
(B) CPU idle exclusively
(C) Disk batch-only tasks
(D) Task loads are dynamic and unpredictable across processors

10. Load balancing in global scheduling:
(A) Memory-only scheduling
(B) CPU idle exclusively
(C) Disk batch-only balancing
(D) Helps prevent some processors from being overloaded while others are idle

11. In global scheduling, preemption allows:
(A) Memory-only execution
(B) CPU idle exclusively
(C) Disk batch-only tasks
(D) Higher-priority tasks to interrupt lower-priority tasks on any processor

12. Task migration overhead affects:
(A) Memory-only efficiency
(B) CPU idle exclusively
(C) Disk batch-only performance
(D) Response time and system schedulability

13. Global scheduling algorithms must consider:
(A) CPU idle exclusively
(B) Task deadlines, execution times, and processor availability
(C) Disk batch-only scheduling
(D) Memory-only constraints

14. Advantage of global EDF over global RMS:
(A) Disk batch-only scheduling
(B) CPU idle exclusively
(C) Global EDF can achieve higher schedulability under certain conditions
(D) Memory-only tasks

15. Global fixed-priority scheduling assigns:
(A) Static priorities to tasks, but tasks can run on any processor
(B) CPU idle exclusively
(C) Disk batch-only priorities
(D) Memory-only scheduling

16. Migration in global scheduling may be limited to:
(A) Reduce overhead while maintaining load balancing
(B) CPU idle exclusively
(C) Disk batch-only movement
(D) Memory-only migration

17. Global scheduling is more effective than partitioned scheduling when:
(A) Memory-only tasks
(B) CPU idle exclusively
(C) Disk batch-only tasks
(D) The system has highly dynamic or unbalanced workloads

18. One challenge of global scheduling is:
(A) Complexity in ensuring deadlines under task migration
(B) CPU idle exclusively
(C) Disk batch-only complexity
(D) Memory-only limitations

19. Preemptive global scheduling allows:
(A) CPU idle exclusively
(B) Real-time tasks to be interrupted and resumed on any processor
(C) Disk batch-only interruption
(D) Memory-only execution

20. The main advantage of global scheduling in real-time systems is:
(A) Disk batch-only optimization
(B) CPU idle exclusively
(C) Efficient utilization of multiple processors with flexibility in task assignment
(D) Memory-only efficiency