1. What is the main goal of multiprocessor real-time scheduling?
(A) To replace real-time operating systems
(B) To store execution logs only
(C) To assign tasks to multiple processors while meeting deadlines and optimizing performance
(D) To execute batch-only tasks
2. Which scheduling approach distributes tasks across multiple processors with fixed assignment?
(A) Round-robin scheduling
(B) Global scheduling
(C) Cooperative scheduling
(D) Partitioned scheduling
3. In global scheduling, tasks:
(A) Are fixed to a single processor
(B) Can migrate between processors based on priority and availability
(C) Are executed sequentially only
(D) Are limited to one processor at a time permanently
4. A major challenge in multiprocessor real-time scheduling is:
(A) CPU idle exclusively
(B) Synchronization and resource sharing between processors
(C) Disk batch-only management
(D) Memory-only allocation
5. One advantage of partitioned scheduling is:
(A) Simplicity and low runtime overhead
(B) Unlimited task migration
(C) CPU idle exclusively
(D) Disk batch-only optimization
6. One advantage of global scheduling is:
(A) Memory-only balancing
(B) CPU idle exclusively
(C) Disk batch-only allocation
(D) Better load balancing across processors
7. Multiprocessor real-time scheduling algorithms must consider:
(A) Disk batch-only tasks
(B) CPU idle exclusively
(C) Task deadlines, priorities, execution times, and processor availability
(D) Memory-only constraints
8. Earliest Deadline First (EDF) can be extended to multiprocessor systems using:
(A) Disk batch-only EDF
(B) CPU idle exclusively
(C) Global EDF (G-EDF) scheduling
(D) Memory-only EDF
9. Rate Monotonic Scheduling (RMS) in multiprocessor systems is often implemented as:
(A) CPU idle exclusively
(B) Partitioned RMS or global RMS
(C) Disk batch-only RMS
(D) Memory-only RMS
10. One key limitation of multiprocessor scheduling is:
(A) Memory-only delays
(B) CPU idle exclusively
(C) Disk batch-only overhead
(D) Task migration overhead and inter-processor communication delays
11. Load balancing in multiprocessor real-time systems aims to:
(A) Disk batch-only load
(B) CPU idle exclusively
(C) Evenly distribute tasks to prevent processor overload
(D) Memory-only balancing
12. Schedulability analysis in multiprocessor systems evaluates:
(A) CPU idle exclusively
(B) Whether all tasks can meet their deadlines on the available processors
(C) Disk batch-only feasibility
(D) Memory-only timing
13. Task migration in global scheduling can cause:
(A) Increased overhead and cache misses
(B) CPU idle exclusively
(C) Disk batch-only delays
(D) Memory-only latency
14. Multiprocessor real-time scheduling is essential for:
(A) Disk batch-only systems
(B) CPU idle exclusively
(C) High-performance, parallel, and safety-critical systems
(D) Memory-only applications
15. Semi-partitioned scheduling combines:
(A) Partitioned and global scheduling approaches for better utilization
(B) CPU idle exclusively
(C) Disk batch-only techniques
(D) Memory-only scheduling
16. Multiprocessor systems require real-time scheduling to handle:
(A) CPU idle exclusively
(B) Inter-processor communication and shared resource access
(C) Disk batch-only coordination
(D) Memory-only tasks
17. Priority-based multiprocessor scheduling assigns tasks based on:
(A) Task priority and deadline across available processors
(B) CPU idle exclusively
(C) Disk batch-only priority
(D) Memory-only levels
18. Multiprocessor real-time scheduling can be analyzed using:
(A) Disk batch-only tools
(B) CPU idle exclusively
(C) Utilization bounds, response time analysis, and simulation
(D) Memory-only methods
19. One challenge in global multiprocessor EDF is:
(A) Memory-only limitations
(B) CPU idle exclusively
(C) Disk batch-only delays
(D) Task migration overhead reducing effective utilization
20. The main goal of multiprocessor real-time scheduling is:
(A) CPU idle exclusively
(B) Ensuring all tasks meet deadlines efficiently across multiple processors
(C) Disk batch-only task completion
(D) Memory-only execution