|
|
|
Algorithms for Data Migration
Yoo-Ah Kim
University of Maryland, College Park
Faculty Candidate, Computer Science
Date : Monday, February 28, 2005
Time : 10:00 - 11:00 a.m.
Location : Science & Tech II, Room 320
Abstract:
Large storage systems typically consist of many devices storing data. To
balance the load across disks, the system computes data layouts that are
typically adjusted according to the workload. As workloads change over time,
the system recomputes the data layout, and then rearranges the data items
according to the new layout. We identify the problem of computing an
efficient data migration plan that involves converting an initial layout to
a target layout. We first show that this problem is NP-hard. We then develop
approximation algorithms for the data migration problem and compare it to
several other heuristic algorithms. In this talk we will present both the
worst case algorithm, as well as the performance evaluation of the different
methods through an experimental study. The talk will conclude with a brief
overview of other research I have done, and a summary of my future research
interests.
Bio: Yoo-Ah Kim is a Ph.D. candidate in the Computer Science Department at
the University of Maryland in College Park. She received her M.S. in 1999
and B.S. in 1997 from Seoul National University. She won the Best Newcomer
Paper Award at PODS 2003. Her research interests are in Algorithms,
especially the design of approximation algorithms with applications in
databases, networking, distributed systems.
Seminar Point of Contact: Prof. Jana Kosecka
The Information Assurance Scholarship
Program is open to U.S. Citizens pursuing undergraduate, masters,
and doctoral degrees from the Centers of Academic Excellence in
Information Assurance Education
Copyright © 1994-2004 Center for Secure Information Systems, George Mason University.
|
