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.
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- K. R. Krishnan. Joining the right queue: A state-dependent decision rule. IEEE Trans. Automat. Control, 35:104--108, 1990.Google ScholarCross Ref
- J. NiÜno-Mora. Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach. Math. Program., 93:361--413, 2002.Google ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- W. Zhu. Allocating soft real-time tasks on cluster. Simulation, 77:219--229, 2001.Google ScholarCross Ref
Recommendations
Marginal productivity index policies for admission control and routing to parallel multi-server loss queues with reneging
NET-COOP'07: Proceedings of the 1st EuroFGI international conference on Network control and optimizationThis paper addresses the problem of designing tractable dynamic admission control and/or routing policies in a Markovian model of parallel multi-server loss queues with reneging, which seek to optimize performance objectives of concern. Such problems ...
Dynamic routing of real-time jobs among parallel EDF queues: A performance study
This paper introduces an analytical method for approximating the performance of a firm real-time system consisting of a number of parallel infinite-capacity single-server queues. The service discipline for the individual queues is earliest-deadline-...
Admission and routing of soft real-time jobs to multiclusters
Motivated by time-sensitive e-service applications, we consider the design of effective policies in a Markovian model for the dynamic control of both admission and routing of a single class of real-time transactions to multiple heterogeneous clusters of ...
Comments