On the performance of multi-level time sharing policy under heavy-tailed workloads

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2009, Pages 956-962

  Jayasinghe, Malith ^a   Tari, Zahir ^a   Zeephongsekul, Panlop ^a   Broberg, James ^b  

^a RMIT UNIVERSITY   (Australia)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE NUMBER; HEAVY-TAILED WORKLOADS; MODERN COMPUTER SYSTEMS; MULTI-LEVEL; PERFORMANCE IMPROVEMENTS; PERFORMANCE METRICS; SERVICE TIME DISTRIBUTION; STATISTICAL REGRESSION MODEL; SYSTEM DESIGNERS; SYSTEM LOADS; TIME-SHARING;

REGRESSION ANALYSIS;

EID: 70449511963     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2009.5202272     Document Type: Conference Paper

References (21)

1. S. Aalto. M/gl11mlps compared with mlgl11ps within service time distribution class imrl. Mathematical Methods of Operational Research,64(2):309-325, October 2006.
2. S. Aalto, U. Ayesta, S. Borst, V. Misra, and R. Nez-Queija. Beyond processor sharing. ACM SIGMETRICS Performance Evaluation Review,34(4), March 2007.
3. S. Aalto, U. Ayesta, and E. Nyberg-Oksanen. Two-level processor-sharing scheduling disciplines: mean delay analysis. Proceedings of the joint international conference on Measurement and modeling ofcomputer systems, New York, USA,32(1):97-105, June 2004.
4. M. Arlitt and C. L. Williamson. Web server workload characterization, the search for invariants. In Proc.1996 ACM SIGMETRICS Conf. on Measurement and Modeling ofComputer Systems,pages 126-138, May 1996.
5. P. Barford, A. Bestavros, A. Bradley, and M. E. Crovella. Changes in web client access patterns: Characteristics and caching implications. World Wide Web, special issue on characterization and performance evaluation,2: 15-28,1999.
6. P. Barford and M. E. Crovella. Generating representative web workloads for network and server performance evaluation. In Proc.1998 ACMSIGMETRICS Conf. on Measurement and Modeling of Computer Systems,pages 151-160,June 1998.
7. J. Cao, W. S. Cleveland, and D. X. Sun. On the nonstationarity of internet traffic. ACM SIGMETRICS Performance Evaluation Review,29(1):102 - 112, June 2001.
8. E. G. Coffman and L. Kleinrock. Feedback queueing models for time-shared systems. Journal of the ACM (JACM),15(4):549-576, October 1968.
9. M. Crovella, M. Harchol-Balter, and C. Murta. Task assignment in a distributed system: Improving performance by unbalancing load. Proc. ACMSigmetrics Conf. Measurement and Modeling of Computer Systems,pages 268-269, June 1998.
10. H. Feng and V. Misra. Mixed scheduling disciplines for network flows. ACM SIGMETRICS Performance Evaluation Review,31(2):36-39, 2003.
11. M. Harchol-Balter, M. Crovella, and C. D. Murta. On choosing a task assignment policy for a distributed server system. Journal ofParallel Distributed Computing,59(2):204-228,1999.
12. M. Harchol-Balter and A. Downey. Exploiting process lifetime distributions for dynamic load balancing. ACM Trans. Computer Systems,15(3):253-285, August 1997.
13. M. Jayasinghe, Z. Tari, P. Zeephongsekul, and J. Broberg. On the performance of multi-level time sharing policy under heavy-tailed workloads. http://goanna.cs. rmit. edu.au/~mjayasin/ publications/technicalreport1.pdf, 2008.
14. L. Kleinrock. Queueing Systems, Volume II: Computer Applications.Wiley Interscience, New York, 1976.
15. M. Nuyens and A. Wierman. The foreground-background queue: a survey. Performance Evaluation, 65(3-4):286-307,March 2008.
16. I. Rai, G. Urvoy-Keller, and E. Biersack. Analysis of las scheduling for job size distributions with high variance. In: Proceedings of ACM Sigmetrics, San Diego, USA,pages 218-228,2003.
17. I. Rai, G. Urvoy-Keller, M. Vernon, and E. Biersack. Performance analysis of las-based scheduling disciplines in a packet switched network. In ACM SIGMETRICS/ PERFORMANCE 2004, New York,pages 106-117,2004.
18. R. Righter and J. G. ShanthiKumar. On external service disciplines in single-stage queueing systems. Journal ofApplied Probability,27:409-416, 1990.
19. L. E. Schrage. The queue mlgl1with feedback to lower priority queues. Management Science,13(7):466-471, March 1967.
20. L. Takacs. Introduction to the Theory of Queues.Oxford U Press, New York, 1962.
21. S. F. Yashkov. Processor-sharing queues: some progress in analysis. Queueing Syst. Theory Appl.,2(1):1-17, 1987.