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 at 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 to minimize 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 solve it. For a variable number of tiers, we show that the decision problem of SAPTS is NP-complete. Then we design a simple two-approximation algorithm and a fully polynomial time approximation scheme (FPTAS). If the number of tiers is a constant, we show that SAPTS is polynomial-time solvable. Furthermore, we design a fast polynomial-time exact algorithm to solve for the important two-tier case. Most of our results extend to the general case where each tier has an arbitrary response time function.
KeywordsKnapsack Problem Polynomial Time Approximation Scheme Fully Polynomial Time Approximation Scheme Total Response Time Tier System
Unable to display preview. Download preview PDF.
- 1.Appleby, K., Fakhouri, S., Fong, L., Goldszmidt, G., Kalantar, M.: Océano – SLAbased management of a computing utility. In: Proc. 7th IFIP/IEEE Intl. Symp. on Integrated Network Management (May 2001)Google Scholar
- 5.Garg, P.K., Hao, M., Santos, C., Tang, H.-K., Zhang, A.: Web transaction analysis and optimization (TAO). In: Proceedings of the 3rd Workshop on Software and Performance, pp. 286–293 (2002)Google Scholar
- 6.Gens, G., Levner, E.: Approximation algorithms for certain universal problems in scheduling theory. Soviet J. of Computers & System Sciences 6, 31–36 (1978)Google Scholar
- 8.Hochbaum, D.S.: A nonlinear knapsack problem. Operations Research Letters (17), 103–110 (1995)Google Scholar
- 12.Menasce, D.A., Almeida, V.A.: Capacity Planning for Web PerformanceGoogle Scholar
- 13.Zhang, A., et al.: Optimal server resource allocation using an open queueing network model of response time. Technical Report HPL-2002-301, HP Labs (2002)Google Scholar
- 14.Zhu, X., Singhal, S.: Optimal resource assignment in internet data centers. In: Proc. 9th MASCOTS, Cincinnati, OH, August 15-18, 2001, pp. 61–69 (2001)Google Scholar