Attaining soft real-time constraint and energy-efficiency in web servers
Proceedings of the 2008 ACM symposium on Applied computing
Adaptive fair resource management with an arbiter for multi-tier computing systems
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Power optimization for dynamic configuration in heterogeneous web server clusters
Journal of Systems and Software
Dynamic optimization of power and performance for virtualized server clusters
Proceedings of the 2010 ACM Symposium on Applied Computing
Introducing Scalileo: a Java based scaling framework
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
A dynamic optimization model for power and performance management of virtualized clusters
Proceedings of the 1st International Conference on Energy-Efficient Computing and Networking
Stochastic approximation control of power and tardiness in a three-tier web-hosting cluster
Proceedings of the 7th international conference on Autonomic computing
Power and performance control of soft real-time web server clusters
Information Processing Letters
Dynamic configuration of virtual machine for power-proportional resource provisioning
Green Computing Middleware on Proceedings of the 2nd International Workshop
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
Proactive dynamic resource management in virtualized data centers
Proceedings of the 2nd International Conference on Energy-Efficient Computing and Networking
ACM SIGOPS Operating Systems Review
Hi-index | 0.00 |
In this paper we study the soft real-time web cluster architecture needed to support e-commerce and related applications. Our testbed is based on an industry standard, which defines a set of web interactions and database transactions with their deadlines, for generating real workload and bench-marking e-commerce applications. In these soft real-time systems, the quality of service (QoS) is usually defined as the fraction of requests that meet the deadlines. When this QoS is measured directly, regardless of whether the request missed the deadline by an epsilon amount of time or by a large difference, the result is always the same. For this reason, only counting the number of missed requests in a period avoids the observation of the real state of the system. Our contributions are theoretical propositions of how to control the QoS, not measuring the QoS directly, but based on the probability distribution of the tardiness in the completion time of the requests. We call this new QoS metric Tardiness Quantile Metric (TQM). The proposed method provides fine-grained control over the QoS so that we can make a closer examination of the relation between QoS and energy efficiency. We validate the theoretical results showing experiments in a multi-tiered e-commerce web cluster implemented using only open-source software solutions.