Hardness of approximation and greedy algorithms for the adaptation problem in virtual environments

Proceedings - 3rd International Conference on Autonomic Computing, ICAC 2006

Volumn 2006, Issue , 2006, Pages 291-292

  Sundararaj, Ananth I ^a   Sanghi, Manan ^a   Lange, John R ^a   Dinda, Peter A ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED APPLICATIONS; VIRTUAL MACHINES (VM);

ADAPTIVE ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; USER INTERFACES;

VIRTUAL REALITY;

EID: 34247599054     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (2)

1. A. Gupta, M. Zangrilli, A. I. Sundararaj, A. Huang, P. Dinda, and B. Lowekamp. Free network measurment for adaptive virtualized distributed computing. In Proceedings of IPDPS, April 2006. To Appear.
2. A. I. Sundararaj, A. Gupta, and P. A. Dinda. Increasing application performance in virtual environments through run-time inference and adaptation. In Proceedings of HPDC, July 2005.