A Fluid-Flow Interpretation of SCED Scheduling

Abstract

We show that a fluid-flow interpretation of Service Curve Earliest Deadline First (SCED) scheduling simplifies deadline derivations for this scheduler. By exploiting the recently reported isomorphism between min-plus and max-plus network calculus and expressing deadlines in a max-plus algebra, deadline computations no longer require explicit pseudo-inverse computations. SCED deadlines are provided for latency-rate as well as a class of piecewise linear service curves.