drf_prop1_alg
def
Given two natural numbers D and m, drf_prop1_alg D m is defined as the real number ((D : ℝ) * (m : ℝ) + (drf_prop1_k D m : ℝ)) * ((m : ℝ) + (drf_prop1_k D m : ℝ)).
Statement
noncomputable def drf_prop1_alg (D m : ℕ) : ℝ
- Defined in
- arXiv:2611.07905 Proposition 1
- Verified
- 06 Nov 2026
- Axioms
- none listed
- Built on 1
- drf_prop1_kIn the lower-bound instance with D resources and parameter m, the number of shared jobs demanding all resources is k = floor(m * sqrt(D)).
- Used by 2
- drf_prop1_ratioFor two natural numbers D and m,
drf_prop1_ratio D mis defined as the real numberdrf_prop1_alg D m / drf_prop1_opt_bound D m. - drf_competitive_ratio_lower_boundFor every natural number D with 1 ≤ D and every real number ρ, if for all natural numbers m with 1 ≤ m we have drf_prop1_alg D m ≤ ρ *…
- drf_prop1_ratioFor two natural numbers D and m,
Read back from the Lean
A definition of a function drf_prop1_alg that assigns to any two natural numbers D and m the real number (D * m + drf_prop1_k D m) * (m + drf_prop1_k D m).
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
/-- Total completion time under Dominant Resource Fairness for the lower-bound instance with D resources and parameter m. -/ noncomputable def drf_prop1_alg (D m : ℕ) : ℝ := ((D : ℝ) * (m : ℝ) + (drf_prop1_k D m : ℝ)) * ((m : ℝ) + (drf_prop1_k D m : ℝ))