Skip to main content

Dynamic Resource Allocation for Shared Data Centers Using Online Measurements

  • Conference paper
  • First Online:
Quality of Service — IWQoS 2003 (IWQoS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2707))

Included in the following conference series:

Abstract

Since web workloads are known to vary dynamically with time, in this paper, we argue that dynamic resource allocation techniques are necessary to provide guarantees to web applications running on shared data centers. To address this issue, we use a system architecture that combines online measurements with prediction and resource allocation techniques. To capture the transient behavior of the application workloads, we model a server resource using a time-domain description of a generalized processor sharing (GPS) server. This model relates application resource requirements to their dynamically changing workload characteristics. The parameters of this model are continuously updated using an online monitoring and prediction framework. This framework uses time series analysis techniques to predict expected workload parameters from measured system metrics. We then employ a constrained non-linear optimization technique to dynamically allocate the server resources based on the estimated application requirements. The main advantage of our techniques is that they capture the transient behavior of applications while incorporating nonlinearity in the system model. We evaluate our techniques using simulations with synthetic as well as real-world web workloads. Our results show that these techniques can judiciously allocate system resources, especially under transient overload conditions.

This research was supported in part by NSF grants CCR-9984030 and EIA-0080119.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Abdelzaher, K. G. Shin, and N. Bhatti. Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach. IEEE Transactions on Parallel and Distributed Systems, 13(1), January 2002.

    Google Scholar 

  2. J. Aman, C.K. Eilert, D. Emmes, P Yocom, and D. Dillenberger. Adaptive algorithms for managing a distributed data processing workload. IBM Sytems Journal, 36(2):242–283, 1997.

    Article  Google Scholar 

  3. E. Anderson, M. Hobbs, K. Keeton, S. Spence, M. Uysal, and A. Veitch. Hippodrome: Running Circles around Storage Administration. In Proceedings of the Conference on File and Storage Technologies, January 2002.

    Google Scholar 

  4. M. Arlitt and T. Jin. Workload Characterization of the 1998 World CupWeb Site. Technical Report HPL-1999-35R1, HP Labs, 1999.

    Google Scholar 

  5. M. Aron, P. Druschel, and S. Iyer. A Resource Management Framework for Predictable Quality of Service inWeb Servers, 2001. http://www.cs.rice.edu/~druschel/publications/mbqos_OnlinePDF.pdf.

    Google Scholar 

  6. N. Bhatti and R. Friedrich. Web server support for tiered services. IEEE Network, 13(5), September 1999.

    Google Scholar 

  7. G. Box and G. Jenkins. Time Series Analysis: Forecasting and Control. Holden-Day, 1976.

    Google Scholar 

  8. A. Brown, D. Oppenheimer, K. Keeton, R. Thomas, J. Kubiatowicz, and D. Patterson. ISTORE: Introspective Storage for Data-Intensive Network Services. In Proceedings of the Workshop on Hot Topics in Operating Systems, March 1999.

    Google Scholar 

  9. A. Bryson and Y. Ho. Applied Optimal Control. Ginn and Company, 1969.

    Google Scholar 

  10. J. Carlström and R. Rom. Application-Aware Admission Control and Scheduling in Web Servers. In Proceedings of the IEEE Infocom 2002, June 2002.

    Google Scholar 

  11. A. Chandra, W. Gong, and P. Shenoy. Dynamic resource allocation for shared data centers using online measurements. Technical Report TR02-30, Department of Computer Science, University of Massachusetts, 2002.

    Google Scholar 

  12. J. Chase, D. Anderson, P. Thakar, A. Vahdat, and R. Doyle. Managing energy and server resources in hosting centers. In Proceedings of the Eighteenth ACM Symposium on Operating Systems Principles (SOSP), pages 103–116, October 2001.

    Google Scholar 

  13. H. Chen and P. Mohapatra. The content and access dynamics of a busy web site: findings and implications. In Proceedings of the IEEE Infocom 2002, June 2002.

    Google Scholar 

  14. M R. Crovella and A. Bestavros. Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes. IEEE/ACM Transactions on Networking, 5(6):835–846, December 1997.

    Article  Google Scholar 

  15. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queueing algorithm. In Proceedings of ACM SIGCOMM, pages 1–12, September 1989.

    Google Scholar 

  16. R. Doyle, J. Chase, O. Asad, W. Jin, and Amin Vahdat. Model-Based Resource Provisioning in a Web Service Utility. In Proceedings of USITS’03, March 2003.

    Google Scholar 

  17. K Appleby et. al. Oceano-sla-based management of a computing utility. In Proceedings of the IFIP/IEEE Symposium on Integrated Network Management, May 2001.

    Google Scholar 

  18. S.J. Golestani. A self-clocked fair queueing scheme for high speed applications. In Proceedings of INFOCOM’94, pages 636–646, April 1994.

    Google Scholar 

  19. P. Goyal, H. Vin, and H. Cheng. Start-time Fair Queuing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. In Proceedings of the ACM SIGCOMM’ 96 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, pages 157–168, August 1996.

    Google Scholar 

  20. J. Hellerstein, F. Zhang, and P. Shahabuddin. A Statistical Approach to Predictive Detection. Computer Networks, January 2000.

    Google Scholar 

  21. S. Lee, J. Lui, and D. Yau. Admission control and dynamic adaptation for a proportional-delay diffserv-enabled web server. In Proceedings of SIGMETRICS, 2002.

    Google Scholar 

  22. B. Liu and D. Figueiredo. Queuing Network Library for SSF Simulator, January 2002. http://www-net.cs.umass.edu/fluidsim/archive.html.

    Google Scholar 

  23. J. Liu and D. M. Nicol. DaSSF 3.0 User’s Manual, January 2001. http://www.cs.dartmouth.edu/~jasonliu/projects/ssf/docs.html.

    Google Scholar 

  24. Z. Liu, M. Squillante, and J. Wolf. On Maximizing Service-Level-Agreement Profits. In Proceedings of the 3rd ACM conference on Electronic Commerce, 2001.

    Google Scholar 

  25. C. Lu, T. Abdelzaher, J. Stankovic, and S. Son. A Feedback Control Approach for Guaranteeing Relative Delays in Web Servers. In Proceedings of the IEEE Real-Time Technology and Applications Symposium, June 2001.

    Google Scholar 

  26. C. Lu, G. Alvarez, and J. Wilkes. Aqueduct: Online Data Migration with Performance Guarantees. In Proceedings of the Conference on File and Storage Technologies, January 2002.

    Google Scholar 

  27. Y. Lu, T. Abdelzaher, C. Lu, and G. Tao. An Adaptive Control Framework for QoS Guarantees and its Application to Differentiated Caching Services. In Proceedings of the Tenth International Workshop on Quality of Service (IWQoS 2002), May 2002.

    Google Scholar 

  28. Using MATLAB. MathWork, Inc., 1997.

    Google Scholar 

  29. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks — the single node case. In Proceedings of IEEE INFOCOM’ 92, pages 915–924, May 1992.

    Google Scholar 

  30. P. Pradhan, R. Tewari, S. Sahu, A. Chandra, and P. Shenoy. An Observation-based Approach Towards Self-Managing Web Servers. In Proceedings of the Tenth International Workshop on Quality of Service (IWQoS 2002), May 2002.

    Google Scholar 

  31. S. Ranjan, J. Rolia, and E. Knightly H. Fu. QoS-Driven Server Migration for Internet Data Centers. In Proceedings of the Tenth International Workshop on Quality of Service (IWQoS 2002), May 2002.

    Google Scholar 

  32. M. Seltzer and C. Small. Self-Monitoring and Self-Adapting Systems. In Proceedings of the Workshop on Hot Topics in Operating Systems, May 1997.

    Google Scholar 

  33. F. Zhang and J. L. Hellerstein. An approach to on-line predictive detection. In Proceedings of MASCOTS 2000, August 2000.

    Google Scholar 

  34. R. Zhong, C. Lu, T. F. Abdelzaher, and J. A. Stankovic. Controlware: A middleware architecture for feedback control of software performance. In Proceedings of ICDCS, July 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chandra, A., Gong, W., Shenoy, P. (2003). Dynamic Resource Allocation for Shared Data Centers Using Online Measurements. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-44884-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40281-7

  • Online ISBN: 978-3-540-44884-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics