📘 Book: Real-Time Systems by Jane W. S. Liu ⭐ Overall Rating: 4.5/5 (Excellent for theory, moderate for practical implementation)
✅ Strengths
Comprehensive Theoretical Foundation
Covers essential scheduling algorithms: Rate Monotonic Scheduling (RMS) , Earliest Deadline First (EDF) , Least Laxity First (LLF) , etc. Detailed analysis of feasibility conditions and utilization bounds (e.g., Liu & Layland bound for RMS: ( U \leq n(2^{1/n} - 1) )).
Rigorous Mathematical Approach
Includes proofs for schedulability tests. Excellent for graduate-level courses or researchers.
Well-Structured Chapters
Topics progress logically: task models → fixed-priority scheduling → dynamic priority → resource access protocols (Priority Ceiling Protocol, Stack Resource Policy) → handling aperiodic/sporadic tasks.
Classic Resource Access Protocols
Clear explanation of Priority Inversion and how protocols like PCP and SRP solve it.
❌ Weaknesses
Outdated Examples & Technology
📘 Book: Real-Time Systems by Jane W. S. Liu ⭐ Overall Rating: 4.5/5 (Excellent for theory, moderate for practical implementation)
✅ Strengths
Comprehensive Theoretical Foundation
Covers essential scheduling algorithms: Rate Monotonic Scheduling (RMS) , Earliest Deadline First (EDF) , Least Laxity First (LLF) , etc. Detailed analysis of feasibility conditions and utilization bounds (e.g., Liu & Layland bound for RMS: ( U \leq n(2^{1/n} - 1) )). real time systems liu
Rigorous Mathematical Approach
Includes proofs for schedulability tests. Excellent for graduate-level courses or researchers.
Well-Structured Chapters
Topics progress logically: task models → fixed-priority scheduling → dynamic priority → resource access protocols (Priority Ceiling Protocol, Stack Resource Policy) → handling aperiodic/sporadic tasks.
Classic Resource Access Protocols
Clear explanation of Priority Inversion and how protocols like PCP and SRP solve it. 📘 Book: Real-Time Systems by Jane W
❌ Weaknesses
Outdated Examples & Technology