Faculty of Engineering and Natural Sciences
Bicriteria load balancing—some new results and directions
We study the load balancing problem on two independent criteria. As balancing one criterion is NP-hard, we cannot find any polynomial time solution to our problem unless P=NP, and approximate solutions are expected. In this talk, the scenario we will use is a system of M distributed file servers located in a cluster. Load balancing is done whenever a document is placed into the system, as well as removed from a server if document deletion is considered. We will give an overview of our theoretical online and offline solutions, and some techniques used, for various combinations of system assumptions such as the existence of heterogeneous servers, and the allowance of document replication and/or reallocation. We will discuss some potential future research directions.
Savio Tse received his BSc degree in physics and PhD degree in computer science from The University of Hong Kong in 1988 and 1997, respectively. After graduation, he had been a visiting assistant professor and a guest lecturer at The University of Hong Kong for three years, and a lecturer at the
University for three years. He is an assistant professor in
University until June, and will continue in
University in the coming September. His research interests are load balancing, compact routing, mobile computing, and many areas in parallel and
June 3, 2009, 13:40,