• 1 Introduction
    • 1.1 Related Work.
  • 2 Preliminaries
    • 2.1 Small Frequency Conjecture.
  • 3 The Pareto Surface
    • 3.1 The Pareto Trie.
    • 3.2 Uniqueness.
  • 4 Engineering Pinwheel Scheduling
    • 4.1 The Naïve Algorithm.
    • 4.2 The Optimised Algorithm.
    • 4.3 The Foresight Algorithm.
    • 4.4 Deciding Tight Feasibility.
  • 5 Engineering the 5/6 Surfaces
    • 5.1 Core algorithm.
    • 5.2 Constructing the Pareto Surface.
    • 5.3 Searching the Pareto Surface.
  • 6 Performance Evaluation
    • 6.1 Pinwheel Schedulers.
    • 6.2 Constructing the 5/6 Pareto Surface.
    • 6.3 Searching the Pareto Surface.
  • 7 Conclusion
  • References
  • A Omitted Proofs from sec:algorithms
  • B Worked Examples
    • B.1 Worked Examples.