Hostname: page-component-89b8bd64d-rbxfs Total loading time: 0 Render date: 2026-05-07T11:27:22.465Z Has data issue: false hasContentIssue false
  • English
  • Français

PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULING

Published online by Cambridge University Press:  17 May 2011

Samuli Aalto ,
Urtzi Ayesta  and
Rhonda Righter
Samuli Aalto
Affiliation:
Aalto University, Espoo, Finland E-mail: samuli.aalto@tkk.fi
Urtzi Ayesta
Affiliation:
Basque Center for Applied Mathematics, Derio, Spain, and Basque Foundation for Science, Derio, Spain E-mail: ayesta@bcamath.org
Rhonda Righter
Affiliation:
University of California at Berkeley, Berkeley, CA E-mail: rrighter@ieor.berkeley.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider the optimal scheduling problem for a single-server queue without arrivals. We allow preemptions, and our purpose is to minimize the expected flow time. The optimal nonanticipating discipline is known to be the Gittins index policy, which, however, is defined in an implicit way. Until now, its general behavior in this specific problem has been characterized only in a few special cases. In this article, we give as complete a characterization as possible. It turns out that the optimal policy always belongs to the family of multilevel processor sharing disciplines.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 25 , Issue 3 , July 2011 , pp. 269 - 288
Copyright
Copyright © Cambridge University Press 2011

References

REFERENCES

1.Aalto, S. & Ayesta, U. (2008). Optimal scheduling of jobs with a DHR tail in the M/G/1 queue. In Proceedings of ValueTools 2008, Athens.CrossRefGoogle Scholar
2.Aalto, S., Ayesta, U., Borst, S., Misra, V. & Núñez-Queija, R. (2007). Beyond processor sharing. ACM Sigmetrics Performance Evaluation Review 34(4): 36–43.CrossRefGoogle Scholar
3.Aalto, S., Ayesta, U. & Righter, R. (2009). On the Gittins index in the M/G/1 queue. Queueing Systems 63: 437–458.CrossRefGoogle Scholar
4.Gelenbe, E. & Mitrani, I. (1980). Analysis and synthesis of computer systems. New York: Academic Press.Google Scholar
5.Gittins, J.C. (1989). Multi-armed bandit allocation indices. New York: Wiley.Google Scholar
6.Kleinrock, L. (1976). Queueing systems, Vol. II: Computer applications. New York: Wiley.Google Scholar
7.Pinedo, M.L. (1995). Scheduling — theory, algorithms, and systems. Englewood Cliffs, NJ: Prentice Hall.Google Scholar
8.Righter, R. & Shanthikumar, J.G. (1989). Scheduling multiclass single server queueing systems to stochastically maximize the number of successful departures. Probability in the Engineering and Informational Sciences 3: 323–334.CrossRefGoogle Scholar
9.Righter, R., Shanthikumar, J.G. & Yamazaki, G. (1990). On extremal service disciplines in single-stage queueing systems. Journal of Applied Probability 27: 409–416.CrossRefGoogle Scholar
10.Sevcik, K.C. (1974). Scheduling for minimum total loss using service time distributions. Journal of the Association for Computing Machinery 21: 66–75.CrossRefGoogle Scholar
11.Yashkov, S.F. (1987). Processor sharing queues: Some progress in analysis. Queueing Systems 2: 1–17.CrossRefGoogle Scholar