Tag
schedulability
- Aug 18, 2026 Earliest-Deadline-First and What Happens When the System Overloads Why dynamic deadline ordering is optimal on one processor, how the utilisation test differs from the fixed-priority one, and how the schedule degrades after a bounded overload. embedded systems
- Jan 9, 2026 EDF, Utilization Bounds, and Schedulability Tests Why earliest-deadline-first reaches full utilization on one CPU, how the density test differs from the utilization test, and what breaks when deadlines exceed periods. operating systems
- Feb 17, 2025 Response-Time Analysis for Fixed-Priority Task Sets The recurrence that computes exact worst-case response time, why it converges, what the blocking term adds, and where the critical instant assumption costs pessimism. embedded systems
- Apr 18, 2024 Worst-Case Response Time of a CAN Message Under Fixed-Priority Arbitration Why the identifier is a priority, how the blocking and interference terms of a response-time bound are computed for a bit-stuffed frame, and where the analysis stops being optimistic. embedded systems