Show simple item record

Data Migration on Parallel Disks

dc.contributor.authorGolubchik, Leanaen_US
dc.contributor.authorKhuller, Samiren_US
dc.contributor.authorKim, Yoo-Ahen_US
dc.contributor.authorShargorodskaya, Svetlanaen_US
dc.contributor.authorWan, Yung-Chun (Justin)en_US
dc.description.abstractOur work is motivated by the problem of managing data on storage devices, typically a set of disks. Such high demand storage servers are used as web servers or multimedia servers, for handling high demand for data. As the system is running, it needs to dynamically respond to changes in demand for different data items. There are known algorithms for mapping demand to a layout. When the demand changes, a new layout is computed. In this work we study the data migration problem, which arises when we need to quickly change one layout to another. This problem has been studied earlier when for each disk the new layout has been prescribed. However, lack of such information leads to an interesting problem that we call the correspondence problem, whose solution has a significant impact on the solution for the data migration problem. We examine algorithms for the data migration problem in more detail and identify variations of the basic algorithm that seem to improve performance in practice, even though some of the variations have poor worst case behavior. UMIACS-TR-2003-115en_US
dc.format.extent446225 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4547en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2003-115en_US
dc.titleData Migration on Parallel Disksen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record