Heavy traffic analysis for single-server SRPT and LRPT queues via EDF diffusion limits

Extending the results of Kruk (Queueing theory and network applications. QTNA 2019. Lecture notes in computer science, vol 11688. Springer, Cham, pp 263–275, 2019), we derive heavy traffic limit theorems for a single server, single customer class queue in which the server uses the Shortest Remaining Processing Time (SRPT) policy from heavy traffic limits for the corresponding Earliest Deadline First queueing systems. Our analysis allows for correlated customer inter-arrival and service times and heavy-tailed inter-arrival and service time distributions, as long as the corresponding stochastic primitive processes converge weakly to continuous limits under heavy traffic scaling. Our approach yields simple, concise justifications and new insights for SRPT heavy traffic limit theorems of Gromoll et al. (Stoch Syst 1(1):1–16, 2011). Corresponding results for the longest remaining processing time policy are also provided.

man and Harchol-Balter (2003). In particular, Bansal and Harchol-Balter (2001) showed that for an M/G/1 queue with a heavy-tailed service time distribution, at least 99% of the jobs had significantly better expected response times under SRPT than under processor sharing (PS), widely regarded as a fair policy. Wierman and Harchol-Balter (2003) observed that for an M/G/1 queue, SRPT treated fairly all jobs under light loads and, moreover, for highers loads, a load increase resulted in an increase of jobs being treated fairly. Schrage and Miller (1966) provided formulae for the mean response time in an M/G/1 SRPT queue. Their work was later extended by Schassberger (1990) and Perera (1993). Another notable contribution was made by Pavlov (1983) and Pechinkin (1986), who obtained the heavy traffic limit of the invariant distributions for the queue length of an M/G/1 SRPT queue. The tail behavior of single server queues under the SRPT protocol was investigated, e.g., by Núñez-Queija (2002) and Nuyens and Zwart (2006). Núñez-Queija (2002) has shown that in the case of heavy-tailed service time distributions, the tail of the sojourn time distribution and the tail of the corresponding service time distribution coincide up to a constant, which is the best possible behavior. For light-tailed service time distributions, using large-deviations techniques, Nuyens and Zwart (2006) have shown that the decay rate of the sojourn time distribution under SRPT is suboptimal (in fact, in most cases the worst possible). They have concluded that, from a large-deviations point of view, it is not advisable to switch from the First-In, First-Out (FIFO) service discipline, known for the maximal sojourn time distribution decay rate (see Ramanan and Stolyar 2001), to SRPT.
Several functional limit theorems for SRPT queueing systems have been established. Down et al. (2009) defined a fluid model and obtained fluid limits for G/G/1 SRPT queues. Gromoll and Keutel (2012) obtained the same fluid limits in the case of the Shortest Job First (SJF) protocol, a non-preemptive version of SRPT. Kruk and Sokołowska (2016) generalized the results of Down et al. (2009) to SRPT queues with multiple inputs. Down and Wu (2006) used diffusion limits to obtain some optimality properties of a multi-layered round robin routing policy in a system of parallel servers operating under SRPT, with a finitely supported service time distribution. Gromoll et al. (2011) established diffusion limits for G/G/1 SRPT queues with general service time distributions. Recently, Puha (2015) and Banerjee et al. (2020) obtained diffusion limits for a G/G/1 SRPT system under nonstandard spatial scaling. Kruk (2019) observed that, under suitable assumptions, the results of Gromoll et al. (2011) could be obtained from heavy traffic limits of Kruk (2007) for preemptive G/G/1 Earliest Deadline First (EDF) queues with job service times correlated with their initial lead times. Recall that under the EDF service discipline, priority is given to the task with the shortest lead time. The main idea of the arguments in Kruk (2019) was to compare the SRPT system with queueing systems having the same stochastic primitives, but operating under EDF, with initial job lead times set to be large multiples of their service times. Since, by the theorem of Schrage (1968), SRPT minimizes the number of customers in the system, the queue length in the EDF system is an upper bound for the queue length in the corresponding SRPT system. Applying this observation, together with heavy traffic limits of Kruk (2007) and elementary lower bounds, the required results may be obtained. The idea of comparing the performance of a SRPT queue with that of the corresponding EDF system, already present in Bender et al. (1998), was previously used to "regularize" the SRPT protocol in order to make it more fair to big tasks. As it has been observed in Kruk (2019), after suitable adjustments, our approach carries over to the Longest Remaining Processing Time (LRPT) discipline, giving preemptive priority to the task with the longest remaining processing time. The latter protocol appears in some applications; see Kittsteiner and Moldovanu (2005), where both SRPT and LRPT queue disciplines arise in equilibria for some priority auctions.

Our work
In this paper, we observe that, after suitable modifications, the arguments of Kruk (2019) work as long as functional central limit theorems for the customer arrival and service times hold (see (8) and (10), to follow), with the limiting processes having continuous sample paths. These assumptions are satisfied in a much more general setting than the i.i.d. case with finite second moments, analyzed in Kruk (2019). For example, all the stochastic primitives may be correlated and may exhibit short-or long-range dependence. In the latter case, we can consider heavy-tailed interarrival and/or service time distributions. Accordingly, the (appropriately scaled) stochastic primitive processes may converge, e.g., to a fractional Brownian motion or a linear fractional stable motion, in addition to the classic Brownian motion case considered in Kruk (2019). For more information on these issues, see Sections 4.4, 4.6 and 4.7 of Whitt (2002).
The extension we present here is obtained without adding notable technical complications to the proofs. Its main idea is simply truncation of the lead times in the corresponding auxiliary EDF systems (i.e., large multiples of the service times) at suitably large levels. This allows for an uniform application of heavy traffic limit theory for EDF queues with bounded lead times, which is notably simpler than its counterpart for the unbounded lead times case (used in Kruk 2019 to analyze SRPT systems with unbounded service times) and requires less technical assumptions. See Kruk (2007) and our Sect. 7, to follow. On the other hand, it turns out that the resulting EDF systems approximate their SRPT counterparts well enough to provide suitable upper bounds for the queue lengths in the latter systems.
Let us also note that in Kruk (2019), the right endpoints of supports of the customer service time distributions in the pre-limit systems were assumed to coincide with the right endpoint of support of their weak limit. This technical condition was necessary in order to use the heavy traffic limits of Kruk (2007) for EDF queues, where an analogous assumption on the customer lead times was made. In order to relax it, in the appendix we provide Theorem 7, a variant of Theorem A.2 from Kruk (2007), allowing the right endpoints of the rescaled initial lead time distributions in the pre-limit EDF queues to vary in a controlled way. Theorem 7 is the basis of our current work.
As a consequence, even in the classical G/G/1 case with finite second moments, our results extend their counterparts from Kruk (2019). Indeed, in Sect. 3.2, to follow, we give Theorems 3 and 4 , providing diffusion limits for this case under weaker assumptions than the ones required in their counterparts from Kruk (2019). For example, we no longer require that [0, ∞], equipped with a special semimetric, defined in terms of the service time distribution, is a totally bounded semimetric space. This paper is organized as follows. Section 2 presents the model, notation and assumptions. In Sect. 3, we state our limit theorems for SRPT queues and we show that they extend analogous results for G/G/1 SRPT systems given in Kruk (2019). In Sect. 4, we define a sequence of auxiliary EDF systems and we characterize their asymptotic behavior in heavy traffic. In Sect. 5, we prove our main results stated in Sect. 3, following the lines of the arguments from Kruk (2019). In Sect. 6, we provide analogous results for single server, single customer class LRPT queueing systems. Section 7 is an appendix in which a variant of Theorem A.2 in Kruk (2007) [extending the results of Doytchinov et al. (2001)], suitable for the applications presented in the previous sections, is stated. Section 8 concludes.

Notation
We will use the following notation. Let N = {1, 2, . . .}, let R denote the set of real numbers and let R + = [0, ∞). Let R + = R + ∪ {∞} and R = R ∪ {∞} be equipped with the obvious topologies. For a, b ∈ R, we write a ∧ b for the minimum of a and b, a + for the positive part of a and a for the largest integer less than or equal to a. Denote by e the identity map on R, i.e., e(t) = t, t ∈ R. For functions f : R + → R + and g : R + → R, we denote the composition of f and g by g Denote by B(R) the Borel σ -field on R. Let M denote the set of all finite, nonnegative measures on B(R). Under the weak topology, M is a Polish space (see Prokhorov 1956). We denote the zero measure in M by 0 and the Dirac delta measure with unit mass at x ∈ R by δ x . For x ∈ R + , let δ + x be δ x if x > 0 and 0 otherwise. For ξ ∈ M and a Borel measurable The symbol ⇒ will be used to denote weak convergence of measures, either on R (in this case, we use the same symbol for convergence of the corresponding cumulative distribution functions (c.d.f.s)), or on the space D S [0, ∞) of right-continuous functions with left-hand limits (RCLL functions) from [0, ∞) to a Polish space S with the Skorokhod J 1 topology. Note that D S [0, ∞) is itself a Polish space. See Ethier and Kurtz (1985) for details. While considering D S [0, ∞), we take S = R or R d , with appropriate dimension d for vectorvalued functions, unless explicitly stated otherwise. In the case of S = R, the lower index S in D S [0, ∞) will usually be skipped.

The basic model
Consider a sequence of single-server queueing systems, indexed by superscript n, each with a single customer class. The customer inter-arrival times are u n j ∞ j=1 , a sequence of strictly positive, identically distributed random variables (r.v.s) with mean 1/λ n . The corresponding service times are v n j ∞ j=1 , a sequence of strictly positive, identically distributed r.v.s with distribution function G n and mean 1/μ n . Each system is empty at time zero and lim n→∞ λ n = lim n→∞ μ n = λ > 0. (1) Moreover, we have where G v is a c.d.f. of a finite positive measure on R + . By (1), G v has total mass 1/λ. We define the customer arrival times the customer arrival process A n (t) Δ = max k : S n k ≤ t , t ≥ 0, and the work arrival process Let W n (t), t ≥ 0, be the workload process which records the amount of work in the queue. The above processes do not depend of the queue service discipline, provided that the server is never idle when there are unfinished tasks in the system. However, the queue length process Q n (t), t ≥ 0, depends on the underlying service protocol.

Heavy traffic assumptions
Let c n be a sequence of constants such that c n → ∞, n/c n → ∞. We make the heavy traffic assumption We assume that where S * and V * have continuous sample paths. Thus, by Theorem 9.3.4 in Whitt (2002), in , the processṼ n a,b is an analog of V n , with the customer service times truncated above b and below a. Hence, the assumption (10) is of the same nature as (8) and it holds under similar conditions. Thanks to (10), the assumption (64) in Theorem 7, to follow, which is the cornerstone of our analysis, is satisfied in the cases presented in the next section.

Results
In this section and in Sects. 4-5 we assume that customers are served using the SRPT queue discipline. In our analysis, we will consider two cases, corresponding to bounded and unbounded service times, respectively. In the first one, we additionally assume that as In the second case, The following theorems are the main results of this paper. (1)-(3), (6), (8), (10) for all a < b, a, b ∈ C, and (11) hold. Then

Theorem 1 Assume that
Theorems 1 and 2 can be easily refined to limit theorems for the corresponding measurevalued state descriptors. Let w n j (t) be the residual service time at time t of the jth customer to appear in the nth SRPT queueing system. For n ∈ N, Note that 1, Q n (t) = Q n (t) and e, Q n (t) = W n (t), so 1, Q n (t) = Q n (t) and e, Q n (t) = W n (t). Theorem 1 implies

Corollary 2 Under the assumptions of Theorem 2 we have
The proofs of Theorems 1, 2 and Corollary 1 will be given in Sect. 5. The assumptions of Theorems 1 and 2 can be simplified if the service time distribution G n ≡ G does not depend on n. In this case, we have Corollary 3 Asume that G n ≡ G for every n ∈ N, and that (6), (8) Corollary 3 follows directly from Theorem 1 and Corollaries 1, 2.

Special case: independent stochastic primitives with second moments
In this subsection we show that the results of the previous subsection extend the corresponding theorems and corollaries from Kruk (2019).
As in Kruk (2019), in this subsection we make the following assumptions. The customer interarrival times form a sequence of strictly positive, independent, identically distributed (i.i.d.) r.v.s with mean 1/λ n and standard deviation α n . The service times v n j ∞ j=1 are also strictly positive, i.i.d., with distribution function G n , mean 1/μ n and standard deviation β n . For every n, the sequences u n j ∞ j=1 and v n j ∞ j=1 are mutually independent, each system is empty at time zero and (1)-(3) hold. We assume that and that (6) holds with We also impose the Lindeberg condition on the inter-arrival times: One may check that the Lindeberg condition on the customer service times follows from (1)- (2) and (15). Under the above assumptions, Theorem 3.1 of Prokhorov (1956) implies (8), where S * and V * are independent, driftless Brownian motions with variances α 2 and β 2 per unit time, respectively. Accordingly, by the (already mentioned) Theorem 9.3.4 in Whitt (2002) (or by the results of Billingsley 1999, Section 17.3), we have (9), where W * is a Brownian motion with drift −γ and variance λ(α 2 + β 2 ) per unit time, instantaneously reflected at the origin.
Theorem 3 extends Theorem 1 of Kruk (2019), because our assumption (11) is less restrictive than the corresponding assumption (4) of Kruk (2019), stating that v * n = v * for each n ∈ N. Also, Theorem 4 extends Theorem 2 of Kruk (2019), because some of the assumptions of the latter theorem [namely (5)-(7) in Kruk (2019) and the assertion that (R + , ρ) is a totally bounded semimetric space, where the semimetric ρ was defined on p. 266 of Kruk 2019] are not necessary for our Theorem 4 to hold.
In order to apply Theorems 1, 2 in the present context, we have to justify the assumption (10) for a, b belonging to a suitable set C dense in R. Let By (1) and (15), and hence the sequence {G n v 2 } ∞ n=1 is uniformly bounded. By Helley's selection principle (see, e.g., Billingsley 1986, Theorem 25.9), for each subsequence of the sequence of the distribution functions {G n v 2 }, we may extract a further subsequence (also indexed by n ∈ N for notational simplicity) such that along this subsequence, where G v 2 is a c.d.f of a finite positive measure on R + (possibly dependent on this subsequence). Let be the set points of continuity of both G v and G v 2 . Clearly, C is dense in R, since R\C is at most countable. For the corresponding subsequence of indices, along which (18) holds, and for every a < b, a, b ∈ C, Theorem 3.1 of Prokhorov (1956) implies that (10) holds with c n given by (16), where the limiting process V * a,b is a driftless Brownian motion with variance (a)) 2 . Therefore, assuming (11) (resp., (12)-(34)), we have that along the subsequence satisfying (18), by Theorem 1 (resp., Theorem 2), Theorem 3 (resp., Theorem 4) holds. However, the resulting limiting distribution of the processes ( Q n , W n ) does not depend on the subsequence chosen. Moreover, by Theorem 1.11 of Prokhorov (1956), weak convergence in D[0, ∞) (and hence in (D[0, ∞)) 2 ) is metrizable. Consequently, it is not hard to see that actually weak convergence of ( Q n , W n ) holds for the entire sequence ( Q n , W n ) ∞ n=1 , as claimed in Theorem 3 (resp., Theorem 4). Similarly as in the more general setup of Sect. 3.1, Theorems 3 and 4 easily imply their counterparts for the measure-valued state descriptors, namely Corollaries 1 and 2 . We also get the following immediate corollary.

Approximating EDF systems and their asymptotics
This section is a preparation for the proofs of our main results, which will be provided in Sect. 5. Here we define a sequence of auxiliary EDF systems and we characterize their asymptotic behavior in heavy traffic.

Approximating EDF systems
Without loss of generality we can take λ = 1, because it is only a convenient rescaling. Fix M ∈ N. Consider a sequence of auxiliary EDF queueing systems, indexed by superscript n. The inter-arrival times for the nth system are u n j ∞ j=1 and the service times are v n j ∞ j=1 . The jth customer arrives at the nth system with an initial lead time (i.e., the time between the arrival and the deadline for completion of service for that customer) Note that In the case of v * < ∞, (11) implies that v n j ≤ v * * Δ = sup n∈N v * n almost surely (a.s.) and hence, for M ≥ v * * (which will be assumed in the corresponding proof), we have Denote by Q n M (t) the queue length process in the nth EDF system and let Q n M (t) = c −1 n Q n M (nt). By the above-mentioned SRPT optimality result, Q n (t) ≤ Q n M (t) for each t ≥ 0, and thus

Auxiliary functions
It is easy to check that the assumption (3) implies uniform integrability of the sequence {v n 1 } ∞ n=1 . This, together with (1)-(2), yields For any y ∈ R, define By (24), the function H is finite and, moreover, it is the complementary c.d.f. of the residual lifetime distribution corresponding to the limiting service time distribution G. For y ∈ R, let The assumptions (1)-(3) and the formulae (20)-(21) imply that For y ∈ R, define Note that in the case of v * < ∞ and M ≥ v * , the formula (26) Similarly, let If for some (and hence all) y ∈ R, we have then the function H M v may be defined by the formula analogous to (26). In particular, if v * < ∞ and M ≥ v * , (28) simplifies to In general, the function H v may be identically equal to ∞, for example, if the service time distribution G n ≡ G does not vary with n and it has sufficiently heavy tails, implying E(v n j ) 2 = ∞. In any case, however, under the assumptions of either Theorem 1, or Theorem 2, the function H M v defined by (28) maps (−∞, v * ∧ M 2 ] onto R + and is strictly decreasing and continuous. Therefore, there exists a continuous, strictly decreasing inverse function  (20), (22) and (11), as n → ∞,

Heavy traffic limits for the EDF systems
while under the assumptions of Theorem 2, by (20), (2) and (12), for n large enough, We claim that under the assumptions of Theorem 1, Indeed, let y, z be the points of continuity of both G M and G v,M such that y * M ≤ y < z. Then, by (20)- (22) and (25), Letting n → ∞, we get 0 In order to get the opposite inequality, let y, z be the points of continuity of both G M and G v,M such that y * v,M ≤ y < z. Then, by (20)- (22) and (25), Letting n → ∞, we obtain G M ≡ const on [y * v,M , ∞), which implies that y * v,M ≥ y * M , so (33) follows. By a similar argument, (12) implies that and hence y * v,M = M 2 , so (33) holds by (32). Hence, (31)-(33) imply that under the assumptions of either Theorem 1 or Theorem 2, we have Let By definition, f M is a continuous, strictly increasing mapping of R + onto R + . Under the assumptions of either Theorem 1 or Theorem 2, (35) and Corollary 6 imply that in D[0, ∞) as n → ∞, jointly with (9), where W * is as in (9).

Proof of Theorem 1
Since v * < ∞ by assumption, for M ≥ v * , the formulae (27), (29)-(30) hold, and hence Consequently, our Theorem 1 can be proved like Theorem 1 in Kruk (2019). We recall the corresponding argument below. First, we will check that for every x ≥ 0, Because f M (0) = 0 for every M, we only have to show (38) for x > 0. Fix x > 0 and let For z < v * being a point of continuity for both G and G v we have, by (1)-(3), (11), the fact that λ = 1 and the Markov inequality, However, for each n, so (11) and (40) yield If z < v * is a point of discontinuity of G or G v , there exist points z n < v * , z n ↓ z such that both G and G v are continuous at z n . Hence, (41) holds at z n and right-continuity of G, G v implies Therefore, by (39) and (42), as M → ∞, we have Consequently, as M → ∞, We have justified (38). The functions f M (x), x/v * are continuous and increasing, so it is easy to verify that the convergence (38) is actually uniform on compact subsets of R + (see, e.g., the proof of Proposition 3.4 in Doytchinov et al. (2001) for a similar reasoning). Let us choose T > 0 and > 0. Take N large enough to assure that Using (9), (37) and the Skorokhod representation theorem (see, e.g., Billingsley 1999, Theorem 6.7), we can construct the model primitives u n j and v n j for j ∈ N, n ∈ N, on a common probability space (Ω, F , P) such that the sequences of processes W n , Q n M , n ∈ N, and the process W * are defined on this space and almost surely (a.s.). Here each a.s. convergence is in the J 1 topology on D[0, ∞) and since the limits are continuous, this is equivalent to uniform convergence on compact intervals. Hence, for n large enough, we have This, together with (44), yields for n large enough. From (23) and (46), we get On the other hand, (11) implies that for each n ∈ N, we have W n (t) ≤ v * n Q n (t) (and hence W n (t) ≤ v * n Q n (t)) for all t ≥ 0 almost surely. Thus, by (45), for n large enough, Finally, the relations (11) and (47)-(48) imply Theorem 1.

Proof of Theorem 2
We follow the lines of the proof of Theorem 2 in Kruk (2019). First, we will check that for every x ≥ 0, By (26) We claim that Indeed, suppose, to the converse, that for some sequence M k → ∞ as k → ∞ and some constant C < ∞, we have y M k /M k ≤ C for all k. Then for k sufficiently large, (34), (50) and the assumption λ = 1 imply that which contradicts the convergence M k → ∞. We have proved (51).
For z being a point of continuity for both G and G v , by (2)-(3), the fact that λ = 1 and the Markov inequality, we have If z is a point of discontinuity of G or G v , there exist points z n ↓ z such that both G and G v are continuous at z n . Consequently, (52) holds at z n and right-continuity of G, G v implies

Limiting distributions for LRPT
In this section we assume that jobs are served according to the LRPT protocol. We also assume (1)-(3), (6), (8) and the following variant of (10). There exists a dense subset C of R, containing ∞, such that for all a < b, a, b ∈ C, we havẽ If v * > 0, then we additionally assume that as n → ∞, In the case of LRPT, we have the following two theorems.
Let us remark that it is not possible to generalize Theorem 6 to convergence in D R [0, ∞). Indeed, for each n we have Q n (0) = 0 a.s.. Furthermore, if ρ n < 1, 0 < c < T and if n is large, then a "typical" sample path of the process Q n hits zero at some time t ∈ [nc, nT ]. Hence, for any 0 < c < T , the convergence Q n ⇒ ∞, n → ∞, cannot hold in D R [c, T ].
Let the measure-valued processes Q n and Q n be defined by (13). Theorem 5 has the following

Corollary 5 Under the assumptions of Theorem 5 we have
The proofs of Theorems 5, 6 and Corollary 5 are similar to the proofs of Theorems 1, 2 and Corollary 1. The most important difference is that in the case of LRPT, we use approximating single server, single customer class EDF systems with initial lead times equal to −Mc n (v n j ∧ M) (or just −Mc n v n j ) instead of Mc n (v n j ∧ M). We omit the details. As in the case of SRPT, if the service time distribution G n ≡ G does not depend on n, then the assumptions for the above results can be simplified. In fact, in this case only (6), (8), (14) and (56) for a < b, a, b ∈ C, need to be assumed for Theorems 5, 6 and Corollary 5 to hold.
The results of this section extend their counterparts from Section 5 of Kruk (2019), just like the results of Sect. 3.1 extend the main results of Kruk (2019) (see our Sect. 3.2). Indeed, as we have already seen, the heavy traffic regime assumed in Kruk (2019) is a special case of the one considered in this paper. Moreover, our assumption (57) is less restrictive than the assumption (9) from Kruk (2019), stating that (in the notation of (57)) v n * = v * for each n ∈ N. and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.

Appendix: Heavy traffic limits for EDF queues
In this Appendix, we state Theorem 7, a variant of Theorem A.2 in Kruk (2007) (extending the results of Doytchinov et al. 2001), which is suitable for the applications described in this paper. The point here is to allow the right endpoint of the rescaled lead time distributions G n to vary with n in a controlled way, see (58)-(59), (63) and (66), to follow. Note that in Doytchinov et al. (2001), it is assumed that the initial lead time distribution G n ≡ G does not vary with n, while in Kruk (2007), initial lead time distributions G n depending on n and satisfying (2) are allowed, but their right endpoints of support y * n , n ∈ N, are assumed to coincide with y * , the right endpoint of support of the limiting distribution G.
Consider a sequence of single-station queueing systems, indexed by superscript n, each with one customer class. Assume that u n j ∞ j=1 , the customer inter-arrival times, are strictly positive, identically distributed r.v.s with mean 1/λ n and v n j ∞ j=1 , the customer service times, are strictly positive r.v.s with mean 1/μ n . We assume that each queue is empty at time zero and (1) holds. Let c n be a sequence of constants such that c n → ∞, n/c n → ∞. Let L n j denote the customer initial lead times, with distribution given by P L n j ≤ c n y = G n (y), y ∈ R, j, n ≥ 1.
We assume that and that (2) holds for some c.d.f. G. By (2) and (60), we have Next, we assume that the random vectors v n j , L n j ∞ j=1 are identically distributed and that where G v is a c.d.f. of a finite, positive measure on R with total mass 1/λ. Let By (2) and (61)- (62), we have y * v ≤ y * . We make the heavy traffic assumption (6) for some γ ∈ R, where ρ n Δ = λ n /μ n . Let S n , V n be defined by (4)-(5). We assume that (8) holds in D R 2 [0, ∞), where the processes S n , V n are defined by (7) and their limits S * , V * have continuous sample paths. Let W n (t), t ≥ 0, be the workload process in the nth system. By Theorem 9.3.4 in Whitt (2002), W n (t) Δ = c −1 n W n (nt) ⇒ W * (t) in D[0, ∞), where, for any t ≥ 0, W * (t) = N * (t) − inf 0≤s≤t N * (s) and N * = (V * − S * ) • λe − γ e. Finally, we assume that there exists a dense subset C of R ∪ {−∞}, containing −∞, such that for every a < b, a, b ∈ C, we havẽ = c −1 n W n (nt)(c n B). Let W * and Q * be measure-valued processes defined by for all Borel sets B ⊆ R.
Theorem 7 Under the preemptive EDF service protocol, subject to the assumptions made above, we have in D M [0, ∞) as n → ∞. If, additionally, then Q n ⇒ Q * in D M [0, ∞) as n → ∞, jointly with (65).
Theorem 7 can be proved by a suitable generalization of the arguments of Doytchinov et al. (2001).
For y ∈ R, define H (y) Let Q n (t) = Q n (t)(R) denote the queue length at time t in the nth system and let Q n (t) Δ = c −1 n Q n (nt) = Q n (t)(R). From Theorem 7, we immediately have Corollary 6 Under the preemptive EDF service protocol, subject to all the assumptions of this section, including (66), Q n ⇒ Q * = H (F * ) = H (H −1 v (W * (t))) in D[0, ∞) as n → ∞, jointly with (9).
It is plausible that the condition (66) in Theorem 7 and Corollary 6 may be replaced by a suitable assumption on the rate of convergence of G n (y * v ) to 1 (implying, in particular, that y * v = y * ), or on the rate of convergence of G n v (y * ) to 1/λ. However, we have not attempted to obtain such a generalization.

Conclusion
We have provided a derivation of heavy traffic limit theorems for single server, single customer class SRPT and LRPT queues from the corresponding heavy traffic limits for EDF queueing systems. A crucial assumption in our analysis, namely weak convergence of the rescaled stochastic primitive processes to continuous limits, is satisfied in many cases of interest, including the G/G/1 case with finite second moments considered in Kruk (2019) and processes exhibiting short-or long-range dependence. We have also presented a variant of a heavy traffic limit theorem for single server EDF queues, suitable for the applications considered in this paper.