Simso Past Paper -

Question (8 pts): Derive the Liu & Layland bound for (n) periodic tasks and state the condition under which Rate‑Monotonic (RM) scheduling guarantees deadline‑met for all tasks.

| Year | Number of SIMSO Questions | Dominant Topics | Notable “Trick” Items | |------|----------------------------|----------------|-----------------------| | | 4 | EDF feasibility, XML configuration, Gantt‑chart reading | “Assume a zero‑overhead context switch.” | | 2023 | 5 | Rate‑Monotonic vs. Deadline‑Monotonic, partitioned vs. global, utilization bound | “Task set is not harmonic – highlight why RM fails.” | | 2024 | 3 | PFair simulation, speed‑scaling, energy‑aware scheduling | “Processor frequency can be scaled only in multiples of 0.5 GHz.” | | 2025 | 4 | Mixed‑criticality tasks, custom scheduler insertion (Python class) | “Provide only the schedule method; do not edit other files.” | | 2026 | 5 | Multi‑core load balancing, deadline‑miss statistics, statistical confidence interval | “Report the 95 % confidence interval for the average response time.” | simso past paper

Check out the official archives on Global Olympiads Academy or Contest Bag to download past papers and start your journey to the Global Finals in Thailand! 🇹🇭🏅 Question (8 pts): Derive the Liu & Layland

Note: In the International Finals held in Thailand, the Science paper typically expands to include 5 additional open-ended questions worth 10 points each. global, utilization bound | “Task set is not

Provides comprehensive Science Syllabi and competition overviews. SIMSO - Global Olympiads Academy

Arithmetic, Number Theory (factors, divisibility), Algebra (logarithms, sequences), Geometry (perimeter, area, circles), and Combinatorics (permutations, probability).