Sciweavers

COCOON
2005
Springer

Server Allocation Algorithms for Tiered Systems

14 years 5 months ago
Server Allocation Algorithms for Tiered Systems
Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS metrics for these applications is the expected response time for the user. Since the expected response time in any tier depends upon the number of servers allocated to this tier, and a request’s total response time is the sum of the response times over all the tiers, many different configurations (number of servers allocated to each tier) can satisfy the expected response time requirement. Naturally, one would like to find the configuration that minimizes the total system cost while satisfying the total response time requirement. This is modeled as a non-linear optimization problem using an open-queuing network model of response time, which we call the server allocation problem for tiered systems (SAPTS). In this paper we study the computational complexity of SAPTS and design efficient algorithms to so...
Kamalika Chaudhuri, Anshul Kothari, Rudi Pendaving
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where COCOON
Authors Kamalika Chaudhuri, Anshul Kothari, Rudi Pendavingh, Ram Swaminathan, Robert Endre Tarjan, Yunhong Zhou
Comments (0)