University of Maryland, College Park
Date: Thursday, February 23, 2006
Location: Engineering I, Room 2114
I will describe some algorithms for addressing some fundamental
optimization problems that arise in the context of data storage and
management. In the first part of the talk we will address the
following question: How should we store data in order to effectively
cope with non-uniform demand for data? How many copies of popular data
objects do we need? Where should we store them for effective load
In the second part of the talk we will address the issue of moving
data objects quickly, to react to changing demand patterns. We will
develop approximation algorithms for these problems.
The first part of the talk is joint work with Golubchik, Khanna,
Thurimella and Zhu. The second part is joint work with Kim and Wan.
Host: Subhash Suri