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
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

A system for dynamic server allocation in application server clusters

Tools
- Tools
+ Tools

Chester, Adam P., Xue, J. W. J., He, Ligang and Jarvis, Stephen A. (2008) A system for dynamic server allocation in application server clusters. In: IEEE International Symposium on Parallel and Distributed Processing with Applications, Sydney, Australia, Dec 10-12, 2008. Published in: IEEE International Parallel and Distributed Processing with Applications Symposium. Proceedings pp. 130-139. ISBN 9780769534718. doi:10.1109/ISPA.2008.88

[img] PDF
ISPA08.pdf - Accepted Version
Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer.

Download (1988Kb)
Official URL: http://dx.doi.org/10.1109/ISPA.2008.88

Request Changes to record.

Abstract

Application server clusters are often used to service high-throughput web applications. In order to host more than a single application, an organisation will usually procure a separate cluster for each application. Over time the utilisation of the clusters will vary, leading to variation in the response times experienced by users of the applications.

Techniques that statically assign servers to each application prevent the system from adapting to changes in the workload, and are thus susceptible to providing unacceptable levels of service. This paper investigates a system for allocating server resources to applications dynamically, thus allowing applications to automatically adapt to variable workloads. Such a scheme requires meticulous system monitoring, a method for switching application servers between server pools and a means of calculating when a server switch should be made (balancing switching cost against perceived benefits).

Experimentation is performed using such a switching system on a Web application testbed hosting two applications across eight application servers. The testbed is used to compare several theoretically derived switching policies under a variety of workloads. Recommendations are made as to the suitability of different policies under different workload conditions.

Item Type: Conference Item (Paper)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Client/server computing
Journal or Publication Title: IEEE International Parallel and Distributed Processing with Applications Symposium. Proceedings
Publisher: IEEE Computer Society
ISBN: 9780769534718
Official Date: 2008
Dates:
DateEvent
2008Published
Date of first compliant deposit: 13 December 2015
Number of Pages: 10
Page Range: pp. 130-139
DOI: 10.1109/ISPA.2008.88
Status: Not Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access
Conference Paper Type: Paper
Title of Event: IEEE International Symposium on Parallel and Distributed Processing with Applications
Type of Event: Conference
Location of Event: Sydney, Australia
Date(s) of Event: Dec 10-12, 2008

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

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