skip to main content
short-paper

Index policies for admission and routing of soft real-time traffic to parallel queues

Published:15 October 2010Publication History
Skip Abstract Section

Abstract

We consider the design of index policies for admission and routing of soft real-time jobs to parallel queues, comparing three methods with respect to the average deadlinemiss costs incurred, based on individually optimal, policy improvement, and restless bandit indices.

References

  1. M. H. Kallmes and C. G. Cassandras. Two approaches to optimal routing and admission control in systems with real-time traffic. J. Optim. Theory Appl., 84:311--338, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Kao and H. Garć1a-Molina. Scheduling soft real-time jobs over dual non-real-time servers. IEEE Trans. Parallel Distrib. Syst., 7:56--68, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. K. R. Krishnan. Joining the right queue: A state-dependent decision rule. IEEE Trans. Automat. Control, 35:104--108, 1990.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. NiÜno-Mora. Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach. Math. Program., 93:361--413, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  5. J. NiÜno-Mora. Marginal productivity index policies for admission control and routing to parallel multi-server loss queues with reneging. In Proc. NET-COOP 2007, 1st Euro-FGI Conf. Network Control and Optimization (Avignon, France), Lecture Notes Comput. Sci., vol. 4465, pp. 138--149, Berlin, 2007. Springer. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. H. Veatch and L. M. Wein. Scheduling a multiclass make-to-stock queue: Index policies and hedging points. Oper. Res., 44:634--647, 1996.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. P. Whittle. Restless bandits: Activity allocation in a changing world. In J. Gani, editor, A Celebration of Applied Probability, J. Appl. Probab., spec. vol. 25A, pp. 287--298. App. Probab. Trust, Sheffield, UK, 1988.Google ScholarGoogle Scholar
  8. W. Zhu. Allocating soft real-time tasks on cluster. Simulation, 77:219--229, 2001.Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in

Full Access

  • Published in

    cover image ACM SIGMETRICS Performance Evaluation Review
    ACM SIGMETRICS Performance Evaluation Review  Volume 38, Issue 2
    September 2010
    55 pages
    ISSN:0163-5999
    DOI:10.1145/1870178
    Issue’s Table of Contents

    Copyright © 2010 Author

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 15 October 2010

    Check for updates

    Qualifiers

    • short-paper

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader