oneshot_drf_rate
def
For a multidimensional scheduling instance I with D resources, an active set of jobs A, and a job j, the one-shot DRF rate oneshot_drf_rate I A j is defined as min (I.u j) (oneshot_drf_fair_share_rate I A) if j ∈ A, and 0 otherwise.
Statement
noncomputable def oneshot_drf_rate {D : ℕ} (I : MultidimInstance D) (A : Finset (Fin I.n)) (j : Fin I.n) : ℝ
- Defined in
- arXiv:2611.07905 Tight Worst-Case Completion-Time Bounds for Dominant Resource Fairness, Equation (2)
- Verified
- 08 Nov 2026
- Axioms
- none listed
- Built on 2
- MultidimInstanceAn instance of multidimensional scheduling with D resource types and zero release times, consisting of a positive number of jobs n with…
- oneshot_drf_fair_share_rateFor a multidimensional scheduling instance I with D resources and an active set of jobs A, the common fair-share rate…
- Used by 1
- is_oneshot_drf_scheduleA rate allocation x and completion time vector C satisfy is_oneshot_drf_schedule I x C for an instance I with D resources if…
Read back from the Lean
oneshot_drf_rate defines a function that, given a dimension count D : ℕ, a multi-dimensional instance I : MultidimInstance D, an active set of agents A : Finset (Fin I.n), and an agent j : Fin I.n, returns a real number. If j ∈ A, the rate is the minimum of j's peak demand I.u j and the fair share rate oneshot_drf_fair_share_rate I A; otherwise (if j ∉ A), the rate is 0.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- Rate of a job under one-shot DRF. -/ noncomputable def oneshot_drf_rate {D : ℕ} (I : MultidimInstance D) (A : Finset (Fin I.n)) (j : Fin I.n) : ℝ := if j ∈ A then min (I.u j) (oneshot_drf_fair_share_rate I A) else 0