Maximally Stabilizing Task Release Control Policy for a Dynamical Queue
Name
Frazzoli-2010-Maximally stabilizing task release control policy for a dynamical queue.pdf
Size
499.79 KB
Format
Adobe PDF
Checksum (MD5)
63d43656a35078790e802665efd0ebb7
Author(s)
Savla, Ketan
Frazzoli, Emilio
Date Issued
August 2010
Journal
IEEE transactions on automatic control
Publisher
Institute of Electrical and Electronics Engineers / IEEE Control Systems Society
Citation
Savla, Ketan, and Emilio Frazzoli. “Maximally Stabilizing Task Release Control Policy for a Dynamical Queue.” IEEE Transactions on Automatic Control 55.11 (2010) : 2655-2660. Copyright © 2010, IEEE
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/TAC.2010.2069590
