An optimization problem in adaptive virtual environments

Ananth I. Sundararaj, Manan Sanghi*, John R. Lange, Peter A Dinda

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)6-8
Number of pages3
JournalPerformance Evaluation Review
Volume33
Issue number2
DOIs
StatePublished - Sep 2005

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'An optimization problem in adaptive virtual environments'. Together they form a unique fingerprint.

Cite this