Self-adaptive admission control policies for resource-sharing systems

SIGMETRICS/Performance'09 - Proceedings of the 11th International Joint Conference on Measurement and Modeling of Computer Systems

Volumn 37, Issue 1, 2009, Pages 311-322

  Gupta, Varun ^a   Harchol Balter, Mor ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

D.4.8 operating systems : Performance modeling and prediction, queueing theory; G.1.6 numerical analysis : Optimization stochastic programming; Performance

Indexed keywords

D.4.8 [OPERATING SYSTEMS]: PERFORMANCE - MODELING AND PREDICTION, QUEUEING THEORY; G.1.6 [NUMERICAL ANALYSIS]: OPTIMIZATION - STOCHASTIC PROGRAMMING; OPERATING SYSTEMS; PERFORMANCE;

COMPUTER OPERATING SYSTEMS; CONCURRENCY CONTROL; GAME THEORY; OPERATIONS RESEARCH; OPTIMIZATION; QUEUEING THEORY; RESPONSE TIME (COMPUTER SYSTEMS); SERVERS; SIMULATORS; SIZE DISTRIBUTION; STOCHASTIC PROGRAMMING; STOCHASTIC SYSTEMS; TIME SHARING SYSTEMS;

ADAPTIVE CONTROL SYSTEMS;

EID: 70449645013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1555349.1555385     Document Type: Conference Paper

References (27)

1. M. Abouzour. Automatically tuning database server multiprogramming level. Master's thesis, University of Waterloo, 2007.
2. R. Agrawal, M. J. Carey, and M. Livny. Models for studying concurrency control performance: alternatives and implications. SIGMOD Rec., 14(4):108-121, 1985.
3. B. Avi-Itzhak and S. Halfin. Expected response times in a non-symmetric time sharing queue with a limited number of service positions. In Proceedings of ITC, 12:5.4B.2.1-7, 1988.
4. R. Blake. Optimal control of thrashing. In Proceedings of the 1982 ACM SIGMETRICS Conference on Measurements and Modeling of Computer Systems, 1982.
5. S. Borst and R. Núñez-Queija. Introduction to special issue on queueing models for fair resource sharing. Queueing Syst., 53(1-2):5-6, 2006.
6. E. G. Coffman, Jr., R. R. Muntz, and H. Trotter. Waiting time distributions for processor-sharing systems. J. Assoc. Comput. Mach., 17:123-130, 1970.
7. P. J. Denning, K. C. Kahn, J. Leroudier, D. Potier, and R. Suri. Optimal multiprogramming. Acta Informatrica, 7:197-216, 1976.
8. S. Elnikety, E. Nahum, J. Tracy, and W. Zwaenepoel. A method for trasparent admission control and request schedulin in e-commerce web sites. In World-Wide-Web Conference, 2004.
9. A. Fredericks. Approximations for customer viewed delays in multiprogrammed, transaction oriented computer systems. Bell System Technical Journal, 59(9):1559-1574, 1980.
10. V. Gupta and M. Harchol-Balter. Self-adaptive admission control policies for resource-sharing systems. Technical Report CMU-CS-09-115, School of Computer Science, Carnegie Mellon University, 2009.
11. H.-U. Heiss and R. Wagner. Adaptive load control in transaction processing systems. In Proceedings of the 17th International Conference on Large Data Bases (VLDB), 1991.
12. A. Kamra, V. Misra, and E. M. Nahum. Yaksha: A self-tuning controller for managing the performance of 3-tiered web sites. In Twelfth IEEE International Workshop on Quality of Service (IWQOS), 2004.
13. L. Kleinrock. Analysis of a time-shared processor. Naval research logistics quarterly, pages 59-73, 1964.
14. L. Kleinrock. Time-shared systems: A theoretical treatment. J. Assoc. Comput. Mach., 14:242-261, 1967.
15. L. Kleinrock. Queueing Systems; Volume 2: Computer Applications. Wiley, New York, 1976.
16. A. Lee and P. Longton. Queueing process associated with airline passenger check-in. Operations Research Quarterly, 10:56-71, 1959.
17. M. Nuyens and W. van der Weij. Monotonicity in the limited processor sharing queue. Technical Report PNA-E0802, CWI, 2008.
18. V. Ramaswami and G. Latouche. A general class of Markov processes with explicit matrix-geometric solutions. OR Spektrum, 8:209-218, 1986.
19. K. Rege and M. Sengupta. Sojourn time distribution in a multiprogrammed computer system. AT&T Tech. J., 64:1077-1090, 1985.
20. R. Righter, J. G. Shanthikumar, and G. Yamazaki. On extremal service disciplines in single-stage queueing systems. J. Appl. Probab., 27(2):409-416, 1990.
21. D. M. Ritchie and K. Thompson. The Unix time-sharing system. C. ACM, 17(7):365-375, 1974.
22. B. Schroeder, M. Harchol-Balter, A. Iyengar, E. Nahum, and A. Wierman. How to determine a good multi-programming level for external scheduling. In Proceedings of the 22nd International Conference on Data Engineering, Atlanta, GA, April 2006.
23. W. van der Weij, S. Bhulai, and R. van der Mei. Optimal scheduling policies for the limited processor sharing queue. Technical Report WS2008-5, Department of Mathematics, Vrije University, 2008.
24. M. Welsh, D. Culler, and E. Brewer. Seda: an architecture for well-conditioned, scalable internet services. SIGOPS Oper. Syst. Rev., 35(5):230-243, 2001.
25. S. F. Yashkov. Processor-sharing queues: some progress in analysis. Queueing Systems Theory Appl., 2(1):1-17, 1987.
26. J. Zhang and B. Zwart. Steady state approximations of limited processor sharing queues in heavy traffic. Submitted for publication.
27. A. P. Zwart and O. J. Boxma. Sojourn time asymptotics in the M/G/1 processor sharing queue. Queueing Systems Theory Appl., 35(1-4):141-166, 2000.