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

Abstract

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.

Fault Tolerant Task Scheduling Algorithm for Distributed System Based on EDF

“…With the development of computer technology, fault-tolerant scheduling using distributed systems has become a very hot topic in the research field. Due to the continuous expansion of the enterprise's production scale, the acceleration of product upgrading and the improvement of customers' requirements for service quality, the traditional task allocation method can no longer meet the complex and changeable demands in the market competition environment [1][2]. In the multi-objective decision-making optimization problem, the most common is to analyze the fault-tolerant scheduling algorithm for the selection process of the combined resource allocation scheme, which has become one of the most important and effective methods with the best universality [3][4].…”