Lu receives NSF CAREER Award to design low-complexity algorithms for the cloud
2/21/2013 Elise King, CSL Communications
Dynamic scalability, which is the ability of a system to accommodate a growing workload, is crucial for cloud computing to be widely adopted. The enormous size of a cloud requires low-complexity algorithms, but if not designed well, these algorithms can cause significant performance degradation as the system grows. Also, existing algorithms often do not scale because of their centralized, high-complexity nature.
Written by Elise King, CSL Communications
Dynamic scalability, which is the ability of a system to accommodate a growing workload, is crucial for cloud computing to be widely adopted. The enormous size of a cloud requires low-complexity algorithms, but if not designed well, these algorithms can cause significant performance degradation as the system grows. Also, existing algorithms often do not scale because of their centralized, high-complexity nature.
Yi Lu
Yi Lu
CSL Assistant Professor Yi Lu recently received a CAREER Award, given by the National Science Foundation (NSF), to tackle this problem by designing low-complexity algorithms for web services, data management, and measurement and monitoring in the cloud. The program awards junior faculty members who demonstrate their roles through outstanding research and education.
These algorithms will address challenges with dynamic scaling, multi-tenancy and data-intensiveness in the cloud, and challenges with different application workloads including search, social networks and map-reduce. The grant, “Scheduling and Resource Allocation in the Cloud using Graphical Models and Randomized Algorithms,” is $447,865 for five years.