最早截止期优先排序的状态空间崩溃精度
Accuracy of state space collapse for earliest-deadline-first Queues
摘要：
本文提出了一个二阶高负荷服务分析的单服务器队列，处理客户的最后期限使用最早的最后期限优先调度策略。对于这样的系统，被称为实时排队系统，性能是通过满足其最后期限的客户的分数来测量的，而不是更传统的性能测量，诸如客户延迟、队列长度或服务器利用率。为了对这样的系统建模，必须跟踪客户交付时间（直到客户截止日期过去的剩余时间）或等效信息。本文回顾了早期的高负荷服务分析，提供了近似的系统的行为。本文的主要结果是一个二阶分析的发展，给出了近似的准确性和收敛速率的实时排队系统的序列，其高负荷服务限制。
英文摘要：
This paper presents a second-order heavy traffic analysis of a single server queue that processes customers having deadlines using the earliest-deadline-first scheduling policy. For such systems, referred to as real-time queueing systems, performance is measured by the fraction of customers who meet their deadline, rather than more traditional performance measures, such as customer delay, queue length or server utilization. To model such systems, one must keep track of customer lead times (the time remaining until a customer deadline elapses) or equivalent information. This paper reviews the earlier heavy traffic analysis of such systems that provided approximations to the system's behavior. The main result of this paper is the development of a second-order analysis that gives the accuracy of the approximations and the rate of convergence of the sequence of real-time queueing systems to its heavy traffic limit.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
