Three periodic tasks share one processor. Choose compute times and periods and watch a preemptive fixed-priority (rate-monotonic) or earliest-deadline-first schedule unfold as a 3D Gantt timeline. Compare total utilization with the Liu-Layland bound n(2^(1/n)-1), exact response-time analysis and simulated worst responses, and see deadline misses appear. Built from a Blender processor and task cards with numerical checks.