How do you perform schedulability analysis for a real-time system?

Schedulability analysis determines if all tasks in a real-time system will meet their deadlines. For Rate Monotonic (RM) scheduling: Liu & Layland bound: Total utilization U = Σ(Ci/Ti) must be ≤ n(2^(1/n) - 1), where Ci is execution time, Ti is period. For large n, this converges to ~69.3%. Exact analysis uses response time calculation: Ri = Ci + Σ(ceiling(Ri/Tj) × Cj) for all higher priority tasks j. Iteratively compute until Ri converges or exceeds Di (deadline). For EDF: Utilization bound is 100% for independent tasks. For dependent tasks, analyze blocking time from shared resources. Tools: TIMES, Cheddar, custom spreadsheets. Consider: Worst-case execution time (WCET), interrupt overhead, context switch time, blocking time from mutexes. Safety margins account for measurement uncertainty.