Maximally Stabilizing Task Release Control Policy for a Dynamical Queue

Details Maximally Stabilizing Task Release Control Policy for a Dynamical Queue Maximally Stabilizing Task Release Control Policy for a Dynamical Queue

2009-09-20

arxiv.org/abs/0909.3651v2

Mathematics

Optimization and Control

15 pages, 2 figures, journal paper

Scientific paper

In this paper, 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 paper 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.

Affiliated with

Also associated with

No associations

Rating

Maximally Stabilizing Task Release Control Policy for a Dynamical Queue does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Maximally Stabilizing Task Release Control Policy for a Dynamical Queue, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximally Stabilizing Task Release Control Policy for a Dynamical Queue will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-296381