Ilan Cohen: Load Balancing in Cloud Computing: Challenges and Algorithms

Cloud computing opens a new chapter in information technology, by enabling global access to shared pools of resources such as services, data, servers, and computer networks. It drives new digital businesses across enterprises. In the last few years, an unprecedented amount of data center capacity has been built to support cloud computing services' growth. Therefore, optimizing the energy budget of data centers, without harming service level agreements, would result in massive savings for their operators, and significantly contribute to greater environmental sustainability. A key challenge in optimizing cloud computing services is their online nature. That is, they require immediate and irrevocable decisions to be made, based on incomplete input.        
In this talk, I will discuss my work on a major optimization aspect of cloud services: virtual machine placement. Specifically, I will present our results for online vector load balancing problems, a well-studied model for virtual machine placement in cloud services. In those problems, jobs have vector loads and the goal is to balance the load on all dimensions simultaneously. First, I will present algorithms and matching lower bounds for those problems.
Unfortunately, for many practical applications, those bounds are unsatisfactory. Accordingly, by adding restricting, yet practical, assumptions, and by using various novel techniques, we show how to improve those bounds significantly.

 

Date and Time: 
Thursday, January 16, 2020 - 13:30 to 14:30
Speaker: 
Ilan Cohen
Location: 
C110
Speaker Bio: 

Ilan Reuven Cohen is a researcher in theoretical computer science, his research interest lies in the areas of approximation, randomized and online algorithms with game-theoretic aspects. Ilan was a postdoctoral researcher at Centrum Wiskunde & Informatica in Amsterdam hosted by Professor Nikhil Bansal. Before that, he was a postdoc researcher at Simons Institute in Berkeley and at Carnegie Mellon University. His main research interests lie in the areas of approximation, randomized and online algorithms, with game-theoretic aspects. Ilan received a Ph.D. in Computer Science from Tel Aviv University, where he was advised by Professor Yossi Azar. He has received several awards including the Fulbright post-doctoral scholar fellowship and the Gutwirth foundation scholarship.