.png){kind=icon}
返回
Maximally Stabilizing Task Release Control Policy for a Dynamical Queue
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2010.2069590.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this technical note, we introduce a model of dynamical queue, in which the service time depends on the server utilization history. The proposed queueing model is motivated by widely accepted empirical laws describing human performance as a function of mental arousal. The objective of this technical note is to design task release control policies that can stabilize the queue for the maximum possible arrival rate, assuming deterministic arrivals. First, we prove an upper bound on the maximum possible stabilizable arrival rate for any task release control policy. Then, we propose a simple threshold policy that releases a task to the server only if its state is below a certain fixed value. Finally, we prove that this task release control policy ensures stability of the queue for the maximum possible arrival rate.
Keyword:
Queueing analysis
nonlinear dynamical systems
stability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
暂无机构信息
引用论文
Mechanism of Cph1 Phytochrome Assembly from Stopped-Flow Kinetics and Circular Dichroism.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏Mass Spectrometry of Biomolecules: Functional Foods, Nutraceuticals, and Natural Health Products
PREAI
分享收藏 没有更多内容
没有更多内容