Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems

Queueing Systems

Volumn 44, Issue 3, 2003, Pages 209-252

  Armony, Mor ^a   Bambos, Nicholas ^b  

^a NEW YORK UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

Adaptive batching policies; Cone policies; Dynamic scheduling; Switched processing systems; Throughput maximization; Trace based modeling

Indexed keywords

DYNAMICAL SYSTEMS; FEEDFORWARD NEURAL NETWORKS; SCHEDULING;

ASYMPTOTICALLY OPTIMAL; DETERMINISTIC DYNAMICAL SYSTEMS; DYNAMIC SCHEDULING; FEED-FORWARD NETWORK; MAXIMIZE THROUGHPUT; PROCESSING SYSTEMS; THROUGHPUT MAXIMIZATION; THROUGHPUT MAXIMIZATION PROBLEM;

QUEUEING THEORY;

EID: 0037829603     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1024714024248     Document Type: Article

References (29)

1. M. Armony, Queueing networks with interacting service resources, Ph.D. Dissertation, Stanford University (1999).
2. M. Armony and N. Bambos, Queueing networks with interacting service resources, in: Proc. of Allerton Conference 1999, Urbana, 1999, pp. 42-51.
3. F. Baccelli and P. Bremaud, Elements of Queueing Theory (Springer, Berlin, 1994).
4. N. Bambos and J. Walrand, Scheduling and stability aspects of a general class of parallel processing systems, Adv. in Appl. Probab. 25 (1993) 176-202.
5. N. Bambos and K. Wasserman, On stationary tandem queueing networks with job feedback, Queueing Systems 15 (1994) 137-164.
6. S.L. Bell and R.J. Williams, Dynamic scheduling of a system with two parallel servers in heavy traffic with complete resource pooling: Asymptotic optimality of a continuous review threshold policy, Ann. Appl. Probab. 11 (2001).
7. V. Böhm, On the continuity of the optimal policy set for linear programs, SIAM J. Appl. Math. 28(2) (1975) 303-306.
8. A. Budhiraja and P. Dupuis, Simple necessary and sufficient conditions for the stability of constrained processes, SIAM J. Appl. Math. 59(5) (1998) 1686-1700.
9. H. Chen and A. Mandelbaum, Discrete flow networks: bottleneck analysis and fluid approximations, Math. Oper. Res. 16 (1991) 408-446.
10. J.G. Dai, On positive Harris recurrence of multiclass queueing netowrks: A unified approach via fluid limit models, Ann. Appl. Probab. 5 (1995) 49-77.
11. J.G. Dai, Stability of fluid and stochastic processing networks, MaPhySto 9 (1999).
12. J.G. Dai and B. Prabhakar, The throughput of data switches with and without speedup, in: Proc. of IEEE INFOCOM 2000, 2000, pp. 556-564.
13. G.B. Dantzig and M.N. Thapa, Linear Programming 1: Introduction (Springer, Berlin, 1997).
14. P. Dupuis and R. Atar, Optimally stabilizing controls for a deterministic network model, in: Proc. of the Allerton Conference 1999, Urbana, 1999.
15. N. Gans and G.J. van Ryzin, Optimal control of a multiclass, flexible queueing system, Oper. Res. 45(5) (1997) 677-693.
16. N. Gans and G.J. van Ryzin, Optimal control of a parallel processing queueing system, Adv. in Appl. Probab. 30 (1998) 1130-1156.
17. J.M. Harrison, Heavy traffic analysis of a system with parallel servers: asymptotic optimality of discrete-review policies, Ann. Appl. Probab. 8 (1996) 822-848.
18. J.M. Harrison, The BIGSTEP approach to flow management in stochastic processing networks, in: Stochastic Networks: Theory and Applications, eds. F. Kelly, S. Zachary and I. Ziedins (Oxford Univ. Press, Oxford, 1996) pp. 57-90.
19. N. Kahale and P.E. Wright, Dynamic global packet routing in wireless networks, in: Proc. of IEEE INFOCOM 1997, 1997, pp. 1414-1421.
20. R. Leelahakriengkrai and R. Agrawal, Scheduling in multimedia DS-CDMA wireless networks, Technical Report ECE-99-3, ECE Department, University of Wisconsin, Madison, IEEE Trans. Vehicular Technol. (1999) to appear.
21. R. Leelahakriengkrai and R. Agrawal, Scheduling in multimedia wireless networks, in: 17th Internat. Teletraffic Congress, Salvador da Bahia, Brazil, 2001.
22. C. Maglaras, Dynamic scheduling in multiclass queueing networks: stability under discrete-review policies, Queueing Systems 31 (1999) 171-206.
23. C. Maglaras, Discrete-review policies for scheduling stochastic networks: fluid asymptotic optimality, Ann. Appl. Probab. 10(3) (2000) 897-929.
24. N. McKeown, A. Mekkittikul, V. Anantharam and J. Walrand, Achieving 100% throughput in an input-queued switch, IEEE Trans. Commun. 47(8) (1999) 1260-1267.
25. S. Meyn, Feedback regulation for sequencing and routing in multiclass queueing networks, in: 2000 IEEE Internat. Symposium on Information Theory, Sorrento, Italy, 1999.
26. A. Stolyar, Max Weight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic (2001) submitted.
27. L. Tassiulas and P.P. Bhattacharya, Allocation of interdependent resources for maximal throughput, Stochastic Models 16(1) (1999).
28. L. Tassiulas and A. Ephremides, Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, IEEE Trans. Automat. Control 37(12) (1992) 1936-1948.
29. K.M. Wasserman and T. Lennon Olsen, On mutually interfering parallel servers subject to external disturbances, Oper. Res. 49(5) (2001) 700-709.