5. Solve: Three tasks with periods 20, 40, 80 ms and execution times 5, 7, 10 ms. Is RMS feasible? 6. Explain priority inversion with an example.
// Example: Using 'volatile' for hardware register volatile int *status_reg = (int *)0xFFE00000; while ((*status_reg & 0x01) == 0); // Wait for bit 0 to be set | Chapter | Title | Key Topics | Importance | | :--- | :--- | :--- | :--- | | 10 | Real-Time OS | Tasks, processes, threads, task states (ready, running, blocked, waiting), TCB. | Very High | | 11 | Scheduling | Round-robin, Rate Monotonic (RMS), Earliest Deadline First (EDF), priority inversion, mutex, semaphore. | Very High | | 12 | Inter-task Comm | Message queues, mailboxes, pipes, shared memory, deadlock. | High | Embedded Systems Raj Kamal Second Edition Tmh