Utility Functions in Autonomic Systems
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
Resource Allocation for Autonomic Data Centers using Analytic Performance Models
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
Utility-Function-Driven Resource Allocation in Autonomic Systems
ICAC '05 Proceedings of the Second International Conference on Automatic Computing
Designing controllable computer systems
HOTOS'05 Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10
Reinforcement Learning in Autonomic Computing: A Manifesto and Case Studies
IEEE Internet Computing
Adaptive Learning of Metric Correlations for Temperature-Aware Database Provisioning
ICAC '07 Proceedings of the Fourth International Conference on Autonomic Computing
A Regression-Based Analytic Model for Dynamic Resource Provisioning of Multi-Tier Applications
ICAC '07 Proceedings of the Fourth International Conference on Autonomic Computing
Adaptive control of virtualized resources in utility computing environments
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Performance analysis of distributed virtual environments
Performance analysis of distributed virtual environments
1000 Islands: Integrated Capacity and Workload Management for the Next Generation Data Center
ICAC '08 Proceedings of the 2008 International Conference on Autonomic Computing
Service System Resource Management Based on a Tracked Layered Performance Model
ICAC '06 Proceedings of the 2006 IEEE International Conference on Autonomic Computing
Learning Application Models for Utility Resource Planning
ICAC '06 Proceedings of the 2006 IEEE International Conference on Autonomic Computing
Performance model driven QoS guarantees and optimization in clouds
CLOUD '09 Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing
What's inside the Cloud? An architectural map of the Cloud landscape
CLOUD '09 Proceedings of the 2009 ICSE Workshop on Software Engineering Challenges of Cloud Computing
A control theory foundation for self-managing computing systems
IEEE Journal on Selected Areas in Communications
A business driven cloud optimization architecture
Proceedings of the 2010 ACM Symposium on Applied Computing
Future Generation Computer Systems
QoS-Aware Revenue-Cost Optimization for Latency-Sensitive Services in IaaS Clouds
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
An Inter-cloud Outsourcing Model to Scale Performance, Availability and Security
UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
Mechanisms for SLA provisioning in cloud-based service providers
Computer Networks: The International Journal of Computer and Telecommunications Networking
IBM zEnterprise unified resource manager platform performance management
IBM Journal of Research and Development
Enabling cost-aware and adaptive elasticity of multi-tier cloud applications
Future Generation Computer Systems
Optimal collaboration of thin---thick clients and resource allocation in cloud computing
Personal and Ubiquitous Computing
| Hi-index | 0.00 |
In resource provisioning for cloud computing, an important issue is how resources may be allocated to an application mix such that the service level agreements (SLAs) of all applications are met. A performance model with two interactive job classes is used to determine the smallest number of servers required to meet the SLAs of both classes. For each class, the SLA is specified by the relationship: Prob [response time ≤ x] ≥ y. Two server allocation strategies are considered: shared allocation (SA) and dedicated allocation (DA). For the case of FCFS scheduling, analytic results for response time distribution are used to develop a heuristic algorithm that determines an allocation strategy (SA or DA) that requires the smallest number of servers. The effectiveness of this algorithm is evaluated over a range of operating conditions. The performance of SA with non-FCFS scheduling is also investigated. Among the scheduling disciplines considered, a new discipline called probability dependent priority is found to have the best performance in terms of requiring the smallest number of servers.