An optimization problem in adaptive virtual environments
- 1 September 2005
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 33 (2) , 6-8
- https://doi.org/10.1145/1101892.1101895
Abstract
A virtual execution environment consisting of virtual machines (VMs) interconnected with virtual networks provides opportunities to dynamically optimize, at run-time, the performance of existing, unmodified distributed applications without any user or programmer intervention. Along with resource monitoring and inference and application-independent adaptation mechanisms, efficient adaptation algorithms are key to the success of such an effort. In previous work we have described our measurement and inference framework, explained our adaptation mechanisms, and proposed simple heuristics as adaptation algorithms. Though we were successful in improving performance as compared to the case with no adaptation, none of our algorithms were characterized by theoretically proven bounds. In this paper, we formalize the adaptation problem, show that it is NP-hard and propose research directions for coming up with an efficient solution.Keywords
This publication has 5 references indexed in Scilit:
- VSched: Mixing Batch And Interactive Virtual Machines Using Periodic Real-time SchedulingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Increasing application performance in virtual environments through run-time inference and adaptationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Automatic dynamic run-time optical network reservationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Inferring the Topology and Traffic Load of Parallel Programs Running in a Virtual Machine EnvironmentPublished by Springer Nature ,2005
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972