Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

Dynamic resource allocation and active predictive models for enterprise applications

Tools
- Tools
+ Tools

Al-Ghamdi, M., Chester, Adam P., He, Ligang and Jarvis, Stephen A. (2011) Dynamic resource allocation and active predictive models for enterprise applications. In: Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER10), Noordwijkerhout, The Netherlands, 7-9 May 2011

Full text not available from this repository.
Official URL: http://closer.scitevents.org/CLOSER2011/

Abstract

This work is concerned with dynamic resource allocation for multi-tiered, cluster-based web hosting environ- ments. Dynamic resource allocation is reactive, that is, when overloading occurs in one resource pool, servers are moved from another (quieter) pool to meet this demand. Switching servers comes with some overhead, so it is important to weigh up the costs of the switch against possible system gains. In this paper we combine the reactive behaviour of two well known switching policies – the Proportional Switching Policy (PSP) and the Bottleneck Aware Switching Policy (BSP) – with the proactive properties of several workload forecasting models. Seven forecasting models are used, including Last Observation, Simple Algorithm, Sample Moving Average, Exponential Moving Algorithm, Low Pass Filter and Autoregressive Moving Average. As each of the forecasting schemes has its own bias, we also develop three meta-forecasting algorithms (the Active Window Model, the Voting Model and the Selective Model) to ensure consistent and improved results. We show that request servicing capability can be improved by as much as 40% when the right combination of dynamic server switching and workload forecasting are used. As important is that we can generate consistently improved results, even when we apply this scheme to real-world, highly-variable workload traces from several sources.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Date: 8 May 2011
Status: Peer Reviewed
Publication Status: Published
Conference Paper Type: Paper
Title of Event: Proceedings of the 1st International Conference on Cloud Computing and Services Science (CLOSER10)
Type of Event: Conference
Location of Event: Noordwijkerhout, The Netherlands
Date(s) of Event: 7-9 May 2011
Related URLs:
  • Other Repository
  • Open Access File
URI: http://wrap.warwick.ac.uk/id/eprint/45657

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us