Theory of linear and integer programming
Theory of linear and integer programming
Performance by Design: Computer Capacity Planning By Example
Performance by Design: Computer Capacity Planning By Example
An analytical model for multi-tier internet services and its applications
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dynamic Provisioning of Multi-tier Internet Applications
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
Dynamic placement for clustered web applications
Proceedings of the 15th international conference on World Wide Web
Performance modeling and system management for multi-component online services
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Dynamic application placement under service and memory constraints
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A capacity planning process for performance assurance of component-based distributed systems
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Hi-index | 0.00 |
Web portals hosting large-scale internet applications have become popular due to the variety of services they provide to their users. These portals are developed using component technologies. Important design challenges for developers of web portals involve (1) determining the component placement that maximizes the number of users/requests (capacity) without increasing hardware resources and (2) maintaining the performance within certain bounds given by service level agreements (SLAs). The multitude of behavioral patterns presented by users makes it hard to identify the incoming workloads. This paper makes three contributions to the design and evaluation of web portals that address these design challenges. First it introduces an algorithmic framework that combines bin-packing and modeling-based queuing theory to place components onto hardware nodes. This capability is realized by the Component Assignment Framework for multi-tiered internet applications (CAFe). Second, it develops a component-aware queuing model to predict web portal performance. Third, it provides extensive experimental evaluation using the Rice University Bidding System (RUBiS). The results indicate that CAFe can identify opportunities to increase web portal capacity by 25% for a constant amount of hardware resources and typical web application and user workloads.