Stability of linear EDF networks with resource sharing

We consider a linear real-time, multiresource network with generally distributed stochastic primitives and soft customer deadlines, in which some users require service from several shared resources simultaneously. We show that a strictly subcritical network of this type is stable under the preemptive Earliest Deadline First scheduling strategy. Our argument is direct, without using fluid model analysis as an intermediate step. As an application of our main result, we propose a stable proxy for the preemptive Shortest Remaining Processing Time service protocol for linear, strictly subcritical resource sharing networks.